✦ LIBER ✦

Algorithms for approximate string matching

✍ Scribed by Esko Ukkonen

Book ID: 114037752
Publisher: Elsevier Science
Year: 1985
Weight: 867 KB
Volume: 64
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(85)80046-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 programmable array processor architect

A programmable array processor architecture for flexible approximate string matching algorithms

✍ Panagiotis D. Michailidis; Konstantinos G. Margaritis 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 277 KB

Optimizing the cost matrix for approxima

Optimizing the cost matrix for approximate string matching using genetic algorithms

✍ Marc Parizeau; Nadia Ghazzali; Jean-François Hébert 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 793 KB

An approximate string matching algorithm

An approximate string matching algorithm for on-line Chinese character recognition

✍ Derek C.W. Pao; M.C. Sun; Murphy C.H. Lam 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 900 KB

[IEEE 2012 26th IEEE International Paral

[IEEE 2012 26th IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) - Shanghai, China (2012.05.21-2012.05.25)] 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum - Parallel Algorithms for Approximate String Matching with k Mismatches on CUDA

✍ Liu, Yu; Guo, Longjiang; Li, Jinbao; Ren, Meirui; Li, Keqin 📂 Article 📅 2012 🏛 IEEE ⚖ 494 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