✦ LIBER ✦

Fast parallel string prefix-matching

✍ Scribed by Dany Breslauer

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 761 KB
Volume: 137
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00177-k

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast parallel and serial approximate str

Fast parallel and serial approximate string matching

✍ Gad M Landau; Uzi Vishkin 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 755 KB

Tight comparison bounds for the string p

Tight comparison bounds for the string prefix-matching problem

✍ Dany Breslauer; Livio Colussi; Laura Toniolo 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 621 KB

On the Comparison Complexity of the Stri

On the Comparison Complexity of the String Prefix-Matching Problem

✍ Dany Breslauer; Livio Colussi; Laura Toniolo 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 525 KB

In this paper we study the exact comparison complexity of the string prefixmatching problem in the deterministic sequential comparison model with equality tests. We derive almost tight lower and upper bounds on the number of symbol comparisons required in the worst case by on-line prefix-matching al

Parallel string matching with k mismatch

Parallel string matching with k mismatches

✍ Zvi Galil; Raffaele Giancarlo 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 928 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

Fast string matching with k differences

✍ Gad M. Landau; Uzi Vishkin 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 953 KB