✦ LIBER ✦

Faster algorithm of string comparison

✍ Scribed by Q. X. Yang; S. S. Yuan; L. Zhao; L. Chun; S. Peng

Book ID: 106256271
Publisher: Springer-Verlag
Year: 2003
Tongue: English
Weight: 260 KB
Volume: 6
Category: Article
ISSN: 1433-7541
DOI: 10.1007/s10044-002-0180-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A faster algorithm computing string edit

A faster algorithm computing string edit distances

✍ William J. Masek; Michael S. Paterson 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 758 KB

Approximate String Matching: A Simpler F

Approximate String Matching: A Simpler Faster Algorithm

✍ Cole, Richard; Hariharan, Ramesh 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 235 KB

A faster algorithm for the computation o

A faster algorithm for the computation of string convolutions using LZ78 parsing

✍ Valerio Freschi; Alessandro Bogliolo 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 176 KB

A comparison of three string matching al

A comparison of three string matching algorithms

✍ G. De V. Smit 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 462 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

An analytical comparison of two string s

An analytical comparison of two string searching algorithms

✍ Gerhard Barth 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 520 KB