✦ LIBER ✦

An analytical comparison of two string searching algorithms

✍ Scribed by Gerhard Barth

Book ID: 113162634
Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 520 KB
Volume: 18
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(84)90003-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved adaptive string searching al

An improved adaptive string searching algorithm

✍ Z. Liu; X. Du; N. Ishi 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 56 KB

Sunday's OM algorithm can reduce the number of character comparisons by making use of information of character distribution in an alphabet. Smith's adaptive algorithm uses dynamic statistics to reduce comparisons, and its performance is close to that of the OM algorithm in the number of character co

Worst-case behavior of string-searching

Worst-case behavior of string-searching algorithms

✍ Zsolt Tuza 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 649 KB

On the Worst-Case Behavior of String-Sea

On the Worst-Case Behavior of String-Searching Algorithms

✍ Rivest, Ronald L. 📂 Article 📅 1977 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 589 KB

Faster algorithm of string comparison

✍ Q. X. Yang; S. S. Yuan; L. Zhao; L. Chun; S. Peng 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 260 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