๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

String-matching on ordered alphabets

โœ Scribed by Maxime Crochemore

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
975 KB
Volume
92
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

String Matching in the DNA Alphabet
String Matching in the DNA Alphabet
โœ JORMA TARHIO; HANNU PELTOLA ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 89 KB

Searching for long DNA strings is studied. A q-gram variation of the Boyer-Moore algorithm is considered. An alphabet transformation with precomputed tables is utilized to reduce the processing time. Experimental results show that the new algorithm is efficient in practice.

Dictionary-Matching on Unbounded Alphabe
Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries
โœ D. Breslauer ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 861 KB

In the string-matching problem one is interested in all occurrences of a short pattern string in a longer text string. Dictionary-matching is a generalization of this problem where one is looking simultaneously for all occurrences of several patterns in a single text. This paper presents an efficien

Alphabet dependence in parameterized mat
Alphabet dependence in parameterized matching
โœ Amihood Amir; Martin Farach; S. Muthukrishnan ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 746 KB
Experiments on string matching in memory
Experiments on string matching in memory structures
โœ Thierry Lecroq ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 59 KB ๐Ÿ‘ 1 views

Various string matching algorithms have been designed and some experimental work on string matching over bounded alphabets has been performed, but string matching over unbounded alphabets has been little investigated. We present here experimental results where symbols are taken among potentially inf