✦ LIBER ✦

Fast algorithms for approximate circular string matching

✍ Scribed by Barton, Carl; Iliopoulos, Costas S; Pissis, Solon P

Book ID: 125402693
Publisher: BioMed Central
Year: 2014
Tongue: English
Weight: 324 KB
Volume: 9
Category: Article
ISSN: 1748-7188
DOI: 10.1186/1748-7188-9-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for approximate string matchi

Algorithms for approximate string matching

✍ Esko Ukkonen 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 867 KB

Fast approximate string matching

✍ O. Owolabi; D. R. McGregor 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 402 KB

Fast and practical approximate string ma

Fast and practical approximate string matching

✍ Ricardo A. Baeza-Yates; Chris H. Perleberg 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 598 KB

Efficient Algorithms for Approximate Str

Efficient Algorithms for Approximate String Matching with Swaps

✍ Dong Kyue Kim; Jee-Soo Lee; Kunsoo Park; Yookun Cho 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 357 KB

A fast VLSI solution for approximate str

A fast VLSI solution for approximate string matching

✍ Roberto Grossi 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 711 KB

A Comparison of Approximate String Match

A Comparison of Approximate String Matching Algorithms

✍ PETTERI JOKINEN; JORMA TARHIO; ESKO UKKONEN 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 972 KB

Experimental comparisons of the running time of approximate string matching algorithms for the k differences problem are presented. Given a pattern string, a text string, and an integer k, the task is to find all approximate occurrences of the pattern in the text with at most k differences (insertio