Search engine run on: http://users.monash.edu.au/
Glookbib search for: zz0621
%T Int. Workshop on Functional and (Constraint) Logic Programming
%K WFLP, WFL, WFL09,WFLP09,2009, WFLP12,WFLP03,2003, WFLP13,WFLP04,2004,
WFLP16,2016, WFLP18,2018, WFLP19,2019, WFLP20,2020,
wShop,conf,CFP,applications,FP,LP,CLP,http,HREF,www, zz0621, zz0622
%X ? 2022 ?, 2021 ???
[7+ Sept 2020] Bologna, deadline 29 June 2020
[9-13 Sept 2019] Cottbus Germany, deadline 27 May 2019
...
%P P. Sarich
%A et al ...
%A M. F. Weber
%T Alcohol consumption, drinking patterns and cancer incidence in an
Australian cohort of 226,162 participants aged 45 years and over
%J Brit. J. of Cancer
%V 124
%P 513-523
%MOCT
%D 2020
%K jrnl, c2020, c202x, c20xx, zz0621, alcohol, negative, zzAlcohol,
moderate drinking, cancer, risk, risks, human, medicine
%X "... Increasing levels of alcohol intake were assoc. with increased risk of
cancers of the upper aerodigestive tract (1.19; 1.10-1.29), mouth & pharynx
(1.18; 1.08-1.29), oesophagus (1.22; 1.04-1.43), colorectum (1.09;
1.04-1.15), colon (1.13; 1.06-1.20), liver (1.22; 1.04-1.44) & breast (1.11;
1.02-1.21). Breast cancer risk was marginally assoc. with drinking pattern,
with higher risk when intake was concentrated on 1-3 days/week compared to
the same amount spread over 4-7 days (P_interaction = 0.049)."
-- [doi:10.1038/s41416-020-01101-2]['21].
%A A. Karatsuba
%A Yu. Ofman
%T Multiplication of many-digital numbers by automatic computers
%J Proc. USSR Acad. Scis
%V 145
%P 293-294
%D 1962
%O Translation in the acad. j. Physics-Doklady, 7 (1963), pp. 595-596
%K conf, c1962, c196x, c19xx, zz0621, fast, integer arithmetic, multiplication,
algorithm, BigInt
%X Discovered 1960 published 1962, it's the n^{log_2(3)} recursive alg.,
mentioned by Knuth in AoCP vol.2, & beats the O(n^2) "school alg.".
-- K_alg@[wikip]['21].
[Also search for: Toom Cook integer multiplication] and
[also search for: Toom Cook integer multiplication].
%A Andrei Toom, S. Cook
%T Toom Cook multiplication
%D 1963
%K TR, c1963, c196x, c19xx, zz0621, Toom, Cook, fast, integer, arithmetic,
multiplication, BigInt, Toom3
%X "... Given two large integers, a & b, Toom-Cook splits up a & b into k
smaller parts each of length l, & performs operations on the parts. As k
grows, one may combine many of the mult. sub-ops, thus reducing the overall
complexity of the alg.. ..."
-- TC@[wikip]['21].
Toom3, where k=3, "can do a size-3N mult. for the cost of five size-N mult."
Generalization of Karatsuba alg. (1962, in which k=2).
[Also search for: Karatsuba integer multiplication] and
[also search for: Toom Cook integer multiplication].
%A R. E. Goldschmidt
%T Applications of Division by Convergence
%I MIT
%M JUN
%D 1964
%K MSc, c1964, c196x, c19xx, zz0621, fast, integer, arithmetic, division, div,
Goldschmidt division, div
%X pdf@[mit]['21.
Also see, "... uses an iterative process of repeatedly multiplying both the
dividend & divisor by a common factor F_i, chosen such that the divisor
converges to 1. This causes the dividend to converge to the sought
quotient Q. ..."
-- G_div in div@[wikip]['21].
(< Q, R >:=N/D, N=numerator(dividend), D=denominator (divisor),
Q=quotient, R=remainder".)
%A R. A. Vowels
%T Division by 10
%J Australian Comp. J.
%V 24
%N 3
%P 81-85
%M AUG
%D 1992
%K jrnl, ACJ, c1992, c199x, c19xx, zz0621, fast, integer, arithmetic, division,
by constant, constants, div, divisor, ten, div10 decimal, numeral, toString
%X "Division of a binary int. & a binary floating-point mantissa by 10 can be
performed with shifts & adds, yielding a sig. improvement in h/w execution
time, & in s/w execution time if no h/w div instn is available. Several algs.
are given, appropriate to specific m/c word sizes, h/w & h/w instns available
& depending on whether a remainder is required. The int. div algs. presented
here contain a new strategy that produces the correct quotient directly,
without the need for the supplementary correction required of previously-
-published algs.. The algs. are competitive in time with binary coded decimal
(BCD) div by 10. Both the int. & flpt algs. are an order of magnitude faster
than conventional division."
-- pdf@[www]['21].
%A C. Burnikel
%A J. Ziegler
%T Fast recursive division
%J im Stadtwald, D-Saarbrucken
%M OCT
%D 1998
%K TR, c1998, c199x, c19xx, zz0621, fast, integer, arithmetic, division, div,
BigInt
%X "... 2 K(n) + O(n log n) time to divide a 2n-digit number by an n-digit
number where K(n) is the Karatsuba mult alg. time ..."
-- [mpg.de]['21],
[c'teseer]['21].
[Also search for: fast integer arithmetic].
%A N. Moller
%A T. Granlund
%T Improved division by invariant integers
%J IEEE Trans. Comput.
%M JUN
%D 2010
%K jrnl, c2010, c201x, c20xx, zz0621, fast, integer, arithmetic, division, div,
algorithm
%X "... problem of dividing a two-word int. by a single-word int., together with
a few extensions & applications. Due to lack of efficient division instns in
current processors, the division is performed as a mult. using a precomputed
single-word approxn of the reciprocal of the divisor, followed by a couple of
adjustment steps. ..."
-- [doi:10.1109/TC.2010.143]['21] and
pdf@[gmplib]['21].
Also see arith@[wikip]['21] and
div@[wikip]['21].
%A S. Gorantala
%A et al ...
%A B. Gipson
%T A general purpose transpiler for fully homomorphic encryption
%x arXiv
%M JUN
%D 2021
%K TR, c2021, c202x, c20xx, zz0621, homomorphic encryption, data,
FHE, XLS SDK, TFHE
%X "... we present a fully homomorphic encryption transpiler that allows
developers to convert high-level code (e.g., C++) that works on unencrypted
data into high-level code that operates on encrypted data. Thus, our
transpiler makes transformations possible on encrypted data. [It] builds on
Google's open-source XLS SDK & uses an off-the-shelf FHE library, TFHE
to perform low-level FHE operations. ..."
-- 2106.07893@[arXiv]['21].
%A Katherine Johnson
%A Joylette Hylick
%A Katherine Moore
%T My Remarkable Journey: A Memoir
%I HarperLux
%P 352
%M JUN
%D 2021
%K book, c2021, c202x, c20xx, zz0621, woman, women, www, STEM, maths, math,
mathematician, NASA, space, hidden figures, memoir, autobiography
%X 1st ed 2021; pb us$19; uk us isbn:0063090678; uk us isbn13:978-0063090675.
"... K. shares her personal journey from child prodigy in the Allegheny
Mtns of W.Virginia to NASA human computer. In her life after retirement,
she served as a beacon of light for her family and community alike. ..."
[Also search for: Katherine Johnson].
%A Ming Wang
%A et al ...
%A Tiangang Liu
%T Nanopore target sequencing for accurate and comprehensive detection of
SARS-CoV-2 and other respiratory viruses
%J bioRxiv
%M MAR
%D 2020
%O Small, 16(32), 2002169, June 2020
%K TR, MolBio, c2020, c202x, c20xx, zz0621, SARS-CoV-2, SARSCoV2, SARS2,
covid19, coronavirus, virus, pandemic, Wuhan, China, origin, origins,
C24034T, G28077C, sequence, SRA, Bloom, controversial, deleted
%X "... we developed nanopore target sequencing (NTS) to detect SARS-CoV-2 &
other respiratory viruses simultaneously within 6-10h. ... NTS is thus
suitable for contemporary COVID-19 diagnosis; moreover, this platform can be
further extended for diagnosing other viruses or pathogens."
-- bioRxiv [doi:10.1101/2020.03.04.20029538]['21] and in
Small [doi:10.1002/smll.202002169]['21].
(Also see, 'Recovery of deleted deep sequencing data sheds more light on
the early Wuhan SARS-CoV-2 epidemic'
-- J.D.Bloom, BioRxiv [doi:/10.1101/2021.06.18.449051][6/2021], and
'Deleted coronavirus genome seqs trigger scientific intrigue',
-- Nature 6/2021 [doi:10.1038/d41586-021-01731-3]['21] and
"Did a Chinese team 'obscure' early coronavirus sequences?"
-- J.D.Cohen, Sci., 2/7/2021 [doi:10.1126/science.373.6550.15]['21].)
[Also search for: SARSCoV2 origins].
%T WHO-convened Global Study of Origins of SARS-CoV-2: China Part,
Joint WHO-China Study 14 January - 10 February 2021, Joint Report
%I WHO
%D 2021
%K report, WHO, MolBio, c2021, c202x, c20xx, zz0621, SARS CoV 2, SARSCoV2,
SARS2, covid 19, covid19, virus, Wuhan, WIV, Huanan wet market, China,
origin, origins, investigation, pandemic, transmission,
hypotheses, theories, RaTG13, bat, bats, laboratory, lab, leak
%X "... The joint international team comprised 17 Chinese & 17 international
experts from other countries, the World Health Organization (WHO), the
Global Outbreak Alert and Response Network (GOARN), and the World
Organisation for Animal Health (OIE) (Annex B). ...
[p.119-120 on a possible 'lab incident':] ... a laboratory origin of the
pandemic was considered to be extremely unlikely ..."
-- pdf@[www]['21].
(Also see, e.g., [bbc][28/5/2021].)
[Also search for: MolBio SARS2 origin].
%A M. Roberts
%A et al ...
%A C.-B. Schonlieb
%T Common pitfalls and recommendations for using machine learning to detect and
prognosticate for COVID-19 using chest radiographs and CT scans
%J NatureMachineIntell.
%M MAR
%D 2021
%K jrnl, c2021, c202x, c20xx, zz0621, hype, AI, deep learning, NN, ANN,
human health, covid19, diagnosis, stats, biases, errors, mistakes,
weaknesses, validation, flaws, CLAIM, methodology, scientific research
%X "Machine learning methods offer great promise for fast & accurate detection &
prognostication of coronavirus disease 2019 (COVID-19) from std-of-care chest
radiographs (CXR) & chest computed tomography (CT) images. ... [BUT] Our
review finds that *none* of the models identified are of potential clinical
use due to methodological flaws &/or underlying biases. This is a major
weakness, given the urgency with which validated COVID-19 models are needed.
To address this, we give many recommendations which, if followed, will solve
these issues & lead to higher-quality model development & well-documented
manuscripts."
-- [doi:10.1038/s42256-021-00307-0]['21].
%A A. Idris
%A et al ...
%A K. V. Morris
%T A SARS-CoV-2 targeted siRNA-nanoparticle therapy for COVID-19
%J Molecular Therapy
%M MAY
%D 2021
%K jrnl, MolBio, c2021 c202x, c20xx, zz0621, SARSCoV2, SARS CoV2, SARS2,
covid 19, covid19, therapy, mouse, siRNA, GriffithUni, Qld
%X "... we present a highly effective small interfering RNA (siRNA) therapeutic
against SARS-CoV-2 infection using a novel lipid nanoparticle (LNP) delivery
system. Multiple siRNAs targeting highly conserved regions of the ...
virus were screened, & three candidate siRNAs emerged that effectively
inhibit the virus by greater than 90% either alone or in combination with one
another. We simultaneously developed & screened two novel LNP formulations
for the delivery of these candidate siRNA therapeutics to the lungs, an
organ that incurs immense damage during ... infection. Encapsulation of
siRNAs in these LNPs followed by in vivo injection demonstrated robust
repression of virus in the lungs & a pronounced survival advantage to the
treated mice. ..."
-- [10.1016/j.ymthe.2021.05.004]['21].
[Also search for: covid19 therapy].
%A Yafei Mao
%A et al ...
%A E. E. Eicher
%T A high-quality bonobo genome refines the analysis of hominid evolution
%J Nature
%P 77-81
%M JUN
%D 2021
%K jrnl, MolBio, c2021, c202x, c20xx, zz0621, primate, great ape, chimpanzee,
bonobo, genome, nGenome, Pan paniscus, PRJNA526933, SRP301932, hominid,
evolution, incomplete lineage sorting, ILS
%X "... describe a fully annotated, high-quality bonobo genome assembly ... more
than 98% of genes are completely annotated & 99% of the gaps are closed ...
identify more than 5,569 fixed structural variants that specifically
distinguish the b. & chimp. lineages. ... We produce a high-res. map of
incomplete lineage sorting & est. that ~ 5.1% of the human genome is
genetically closer to chimpanzee or bonobo & that more than 36.5% of the
genome shows incomplete lineage sorting if we consider a deeper phylogeny
inc. gorilla & orangutan. We also show that 26% of the segments of incomplete
lineage sorting between hum. & chimp. or human & bonobo are non-randomly
distributed & that genes within these clustered segments show sig. excess of
amino acid replacement compared to the rest of the genome."
"... The Bionano map of bonobo Mhudiblu is deposited in the NCBI under
BioProject accession # PRJNA526933. The raw PacBio HiFi data of bonobo
Mhudiblu & gorilla Kamilah are deposited in the NCBI under SRA acc.
# SRP301932 under BioProject acc. # PRJNA691628. ..."
-- [doi:10.1038/s41586-021-03519-x]['21].
(Also see ILS@[wikip]['21].)
%A J. P. Rogers
%A et al ...
%A A. D. Rooney
%T Neurology and neuropsychiatry of COVID-19: a systematic review and
meta-analysis of the early literature reveals frequent CNS manifestations and
key emerging narratives
%J J. Neurology, Neurosurgery & Psychiatry
%D 2021
%K jrnl, c2021, c202x, c20xx, zz0621, human health, pandemic, long term,
covid-19, longCovid, covid19, side effects, health, illness, risks
%X "... Studies reporting prevalences of neurological or neuropsychiatric
symptoms were synthesised into meta-analyses to estimate pooled prevalence.
... The symptoms with the highest prevalence were anosmia (43.1% (95% CI
35.2%-51.3%), n=15,975, 63 studies), weakness (40.0% (95% CI 27.9%-53.5%),
n=221, 3 studies) ... depression ..."
-- [www]['21],
[doi:10.1136/jnnp-2021-326405]['21].
[Also search for: longCovid].
%A Y. Souilmi
%A et al ...
%A D. Enard
%T An ancient viral epidemic involving host coronavirus interacting genes more
than 20,000 years ago in East Asia
%J Curr. Biol.
%V ?
%M JUN
%D 2021
%K jrnl, MolBio, c2021, c202x, c20xx, zz0621, coronavirus, RNA, corona virus,
zoonotic transfer, SARS, SARS2, covid 19, covid19, CoVVIP, CoV-VIP genes
%X "... we apply evolutionary analyses to human genomic datasets to recover
selection events involving tens of human genes that interact with
coronaviruses, inc. SARS-CoV-2, that likely started more than 20,000 y. ago.
These adaptive events were limited to the pop'n ancestral to E.Asian pop'n.
Multiple lines of functional evidence support an ancient viral selective
pressure, & E.Asia is the geographical origin of several modern coronavirus
epidemics. An arms race with an ancient coronavirus, or with a different
virus that happened to use similar interactions ..."
-- [doi:10.1016/j.cub.2021.05.067]['21].
[Also search for: zoonotic virus].
%A O. J. Kennedy
%A et al
%T All coffee types decrease the risk of adverse clinical outcomes in
chronic liver disease: a UK Biobank study
%J BMC Public Health
%V 21
%N #970
%M JUN
%D 2021
%K jrnl, c2021, c202x, c20xx, zz0621, human, health, risks, liver disease, CLD,
zzCoffee, caffeine, ground, instant, decaf, coffee, positive
%X "... The finding that all types of coffee are protective against CLD is
sig. given the increasing incidence of CLD worldwide & the potential of
coffee as an intervention to prevent CLD onset or progression."
-- [doi:10.1186/s12889-021-10991-7]['21].
[Also search for: zzCoffee].
%A D. E. Knuth
%A L. Shustek
%T Let's not dumb down the history of computer science
%J CACM
%V 64
%N 2
%P 33-35
%M FEB
%D 2021
%K CACM, news, views, c2014, c201x, c2021, c202x, c20xx, zz0621, maths,
computer science, Comp Sci, CompSci, CSci, history, Knuth, Kailath lecture,
talk, seminar, transcript, seminars, Campbell-Kelly, controversial
%X "Editor's note: On May 7, 2014, Don Knuth delivered that year's Kailath
Lecture at Stanford U. to a packed auditorium. In it he decried the absence
of technical content from the histories of CS being written, & he made an
impassioned plea for historians of CS to get back on track, as the historians
of maths. have always been. ... This Viewpoint, which we thank Comms. Snr
Editor Moshe Vardi for suggesting, is a condensed & highly edited transcript
of the original talk that has provoked so much discussion."
-- [doi:10.1145/3442377]['21].
Video of intro & Knuth's talk @[ubend]['21] (via AK).
%A R. Van Noorden
%T Hundreds of gibberish papers still lurk in the scientific literature
%J Nature
%V 593
%P ?
%M MAY
%D 2021
%K news, c2021, c202x, c20xx, zz0621, SCIgen, computer generated, fake,
paper generator, joke, funny, ha ha, haha, hoax, bogus,
SCIdetect, MATHgen, IOP, IEEE
%X "Nonsensical research papers generated by a computer program are still
popping up in the scientific literature many years after the problem was
first seen, a study has revealed. ... The issue began in 2005, when three
PhD students created paper-generating software called SCIgen for 'maximum
amusement', & to show that some confs. would accept meaningless papers. ..."
-- [doi:10.1038/d41586-021-01436-7]['21].
[Also search for: postmodernism].
%A M. Schlapfer
%A et al ...
%A G. B. West
%T The universal visitation law of human mobility
%J Nature
%V 593
%P 522-527
%M MAY
%D 2021
%K jrnl, c2021, c202x, c20xx, zz0621, human behaviour, distance, visit, visits,
frequency, mobility, law, laws
%X "... we reveal a simple & robust scaling law that captures the temporal &
spatial spectrum of pop'n movement on the basis of large-scale mobility data
from diverse cities around the globe. According to this law, the # of
visitors to any location decreases as the inverse square of the product of
their visiting freq. & travel dist.. We further show that the spatio-
temporal flows to different locations give rise to prominent spatial clusters
with an area dist'n that follows Zipf's law. Finally, we build an individual
mobility model based on exploration & preferential return to provide a
mechanistic explanation for the discovered scaling law & the emerging
spatial structure. ..."
-- [doi:10.1038/s41586-021-03480-9]['21].
%A J. J. Gooley
%T Large-scale digital traces of university students show that morning classes
are bad for attendance, sleep, and academic performance
%J bioRxiv
%M MAY
%D 2021
%K TR, c2021, c202x, c20xx, zz0621, Duke, NUS, University, Singapore, teaching,
GPA, results, exams, lecture, lectures, class, classes, student, learning,
early, morning, behaviour
%X "... Wi-Fi connection data were used to est. attendance rates of 24,678
students enrolled in lecture courses with start times ranging from 08:00
to 16:00. ... Analyses of grades in 27,281 s. showed that having morning
classes on more days of the week resulted in a lower grade pt avg.. ...
suggest cumulative -ve effects of morning classes on learning. Early morning
classes force many s. to decide to either sleep more & skip class, or sleep
less to attend class. Therefore, universities should avoid scheduling early
morning classes. ..."
-- [doi:10.1101/2021.05.14.444124]['21].
[Also search for: student learning].
%A M. L. Littman
%T Collusion rings threaten the integrity of computer science research
%J CACM
%V 64
%N 6
%M JUN
%D 2021
%P 43-44
%K CACM, news, viwes, c2021, c202x, c20xx, zz0621, scientific research,
peer review, reviewing, refereeing, academic misconduct, ethics, collusion,
scam, gaming, fraud, KPI, KPIs
%X "... I want to alert the community to a growing problem that attacks the
fundamental assumptions that the review process has depended upon. ... I
became aware of an example in the computer-architecture community where a
jnr researcher may have taken his own life instead of continuing to engage
in a possible collusion ring. ..." [online May '21.]
-- [doi:10.1145/3429776]['21].
[Also search for: academic misconduct] and [also search for: peer review].
%A L. Fortnow
%T Viewpoint: Time for computer science to grow up
%J CACM
%V 52
%N 8
%P 33-35
%M AUG
%D 2009
%K CACM, news, views, c2009, c200x, c20xx, zz0621, computer science, Comp Sci,
CompSci, CSci, scientific, university, academic, research, conference,
conferences, journals, papers, KPI, KPIs
%X "Unlike every other academic field, CS uses confs rather than journals as the
main publn venue. While this made sense for a young discipline, our field has
matured & the conf. model has fractured the discipline & skewered it toward
short-term, deadline-driven research. ..."
-- [doi:10.1145/1536616.1536631]['21] (via GF).
%A N. Veldt
%A A. R. Benson
%A J. Kleinberg
%T The generalized mean densest subgraph problem
%J arXiv
%M JUN
%D 2021
%K TR, c2021, c202x, c20xx, zz0621, mean, densest, dense, subgraph, DSG,
core, kcore, peeling, algorithm, generalised, graph, maths
%X "... introduce a new family of dense subgraph objectives, parameterized by a
single param. p, based on computing generalized means of degree seqs. of a
subgraph. ... captures both the std DSG problem & the maximum k-core as
special cases & provides a way to interpolate between & extrapolate beyond
these two objectives when searching for other notions of DSGs. ... first show
that our objective can be minimized in polynomial time for all p>=1 using
repeated submodular minimization. ... prove that the std peeling alg. can
perform arbitrarily poorly on our generalized objective, but we then design a
more sophisticated peeling method which for p>=1 has an approx'n guarantee
that is always >=1/2 & converges to 1 as p -> inf. ... show that this alg.
obtains extremely good approx'ns to the optimal soln, scales to large graphs,
& highlights a range of different meaningful notions of density ... [&], it
is typically able to approx. the DSG problem better than the std peeling
alg., by better accounting for how the removal of one node affects other
nodes in its neighborhood."
-- 2106.00909@[arXiv]['21].
[Also search for: dense subgraph problem].
%A Lek-Heng Lim
%T Tensors in computations
%J arXiv
%M JUN
%D 2021
%O Acta Numerica, vol.30, pp.555-764, MAY 2021
%K TR, c2021, c202x, c20xx, zz0621, tensor, tensors, intro, numerical methods,
equivariance, multilinearity, separability
%X "The notion of a tensor captures three great ideas: equivariance,
multilinearity, separability. But trying to be 3 things at once makes the
notion difficult to understand. We will explain tensors in an accessible &
elementary way through the lens of linear algebra & numerical linear algebra,
elucidated with examples from computational & applied mathematics.'
-- 2106.08090@[arXiv]['21],
[doi:10.1017/S0962492921000076]['22], Acta Numerica, CUP, AUG. 2021.
[Also search for: tensor].
%A Depeng Xu
%A Shuhan Yuan
%A Xintao Wu
%T Differential privacy preserving causal graph discovery
%J IEEE Symp. on Privacy Aware Computing (PAC)
%D 2017
%K conf, c2017, c201x, c20xx, zz0621, differential privacy, causal graph,
Bayesian, network, stats
%X "... releasing causal graphs may risk leakage of individual participant's
privacy. ... we focus on the PC alg. ... propose a DP PC alg. (PrivPC) for
categorical data. ... For numerical [Cts] data, we further develop a DP
causal discovery alg. (PrivPC*). The idea is to add noise once onto the
covariance matrix ..." [via KL]
-- [doi:10.1109/PAC.2017.24]['21].
[Also search for: differential privacy].
%A S. Tople
%A A. Sharma
%A A. Nori
%T Alleviating privacy attacks via causal learning
%J Proc. of the 37th Int. Conf. on Mach. Learning (PMLR)
%V 119
%P 9537-9547
%D 2020
%K conf, c2020, c202x, c20xx, zz0621, differential privacy, causal model,
Bayesian network
%X "M.L. models, esp. deep NNs are known to be susceptible to privacy attacks
such as membership inference where an adversary can detect whether a data
point was used to train a model. ... exacerbated when a model is used for
predictions on an unseen data dist'n. ... demonstrate the benefit of
predictive models that are based on the causal relationships between input
features & the outcome. ... show that models learnt using causal struct.
generalize better to unseen data ... establish a theor. link between
causality & privacy ..."
-- [www]['21],
1909.12732@[arXiv]['21].
[Also search for: Bayesian network].
%A K. Bringmann
%A V. Cohen-Addad
%A D. Das
%T A linear-time n^{0.4}-approximation for longest common subsequence
%J arXiv
%M JUN
%D 2021
%K TR, c2021, c202x, c20xx, zz0621, longest common subsequence, LCS, LCSS,
strings, approximation algorithm, Abboud
%X "... While a simple quadratic alg. has been known ... for more than 40 years,
no faster alg. has been found despite an extensive effort. The lack of
progress on the problem has recently been explained by Abboud, Backurs, &
Vassilevska Williams [FOCS'15] & Bringmann & Kunnemann [FOCS'15] who proved
that there is no subquadratic alg. unless the Strong Exponential Time
Hypothesis fails. ... we provide an alg. that in time O(n^{2−e}) computes an
~O(n^{2e/5})-apprxn with high prob., for any 0 < e <= 1. Our result (1) gives
an ~O(n^{0.4})-apprxn in linear time, improving upon the bound of Hajiaghayi,
Seddighin, Seddighin, & Sun, (2) provides an alg. whose apprxn scales with
any subquadratic running time O(n^{2-e}), improving upon the naive bound of
O(n^{e/2}) for any e, & (3) instead of only in expectation, succeeds with
high prob.."
-- 2106.08195@[arXiv]['21].
[Also search for: strings approximation algorithm].