Surprises in approximating Levenshtein distances

DOI10.1016/j.jtbi.2006.06.026zbMath1447.92246arXivq-bio/0601006OpenAlexW2003793092WikidataQ80087272 ScholiaQ80087272MaRDI QIDQ2202374

Robert Giegerich, Uwe Grimm, Michael Baake

Publication date: 18 September 2020

Published in: Journal of Theoretical Biology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/q-bio/0601006

Mathematics Subject Classification ID

Applications of statistics to biology and medical sciences; meta analysis (62P10) Genetics and epigenetics (92D10)

Cites Work

• Approximate string-matching with \(q\)-grams and maximal matches
• A sublinear algorithm for weakly approximating edit distance
• Distributional regimes for the number of k -word matches between two random sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Surprises in approximating Levenshtein distances