✦ LIBER ✦

The Computational Hardness of Estimating Edit Distance

✍ Scribed by Andoni, Alexandr; Krauthgamer, Robert

Book ID: 118181033
Publisher: Society for Industrial and Applied Mathematics
Year: 2010
Tongue: English
Weight: 438 KB
Volume: 39
Category: Article
ISSN: 0097-5397
DOI: 10.1137/080716530

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

How Hard Is Computing the Edit Distance?

✍ Giovanni Pighizzini 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 108 KB

Fast computation of distance estimators

✍ Isaac Elias; Jens Lagergren 📂 Article 📅 2007 🏛 BioMed Central 🌐 English ⚖ 710 KB

The undecidability of the unrestricted m

The undecidability of the unrestricted modified edit distance

✍ Vitus J. Leung 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 704 KB

We define the unrestricted modified edit distance based on the modified edit distance defined by Galil and Giancarlo (1989) where the cost of substring deletions and insertions are contextsensitive and the cost of character substitutions are context-free. The modified edit distance is the minimum co

Computing the edit distance of a regular

Computing the edit distance of a regular language

✍ Stavros Konstantinidis 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 216 KB

Fast computation of normalized edit dist

Fast computation of normalized edit distances

✍ Vidal, E.; Marzal, A.; Aibar, P. 📂 Article 📅 1995 🏛 IEEE 🌐 English ⚖ 452 KB

Computation of normalized edit distance

Computation of normalized edit distance and applications

✍ Marzal, A.; Vidal, E. 📂 Article 📅 1993 🏛 IEEE 🌐 English ⚖ 654 KB