Speeding up two string-matching algorithms

Algorithmica

Volumn 12, Issue 4-5, 1994, Pages 247-267

  Crochemore, M ^a   Czumaj, A ^b   Gasieniec, L ^b   Jarominek, S ^b   Lecroq, T ^a   Plandowski, W ^b   Rytter, W ^b  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

Analysis of algorithms; Combinatorial problems; Data retrieval; Pattern matching; Periods; String matching; Suffix automaton; Suffix tree; Text processing

Indexed keywords

AUTOMATA THEORY; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; GRAPHIC METHODS; INFORMATION RETRIEVAL; ONLINE SEARCHING;

BOYER MOORE ALGORITHM; REVERSE FACTOR ALGORITHMS; STRING MATCHING ALGORITHMS;

ALGORITHMS;

EID: 0028516612     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/BF01185427     Document Type: Article

References (17)

1. Algorithms for finding patterns in strings
2. The myriad virtues of suffix trees
3. The Boyer-Moore-Galil string searching strategies revisited
4. Average running time of the Boyer-Moore-Horspool algorithm
5. The smallest automaton recognizing the subwords of a text
6. A fast string searching algorithm
7. Transducers and repetitions
8. On improving the worst case running time of the Boyer-Moore string searching algorithm
9. A new proof of the linearity of the Boyer-Moore string searching algorithm
10. Practical fast searching in strings
11. Fast string searching
12. Fast pattern matching in strings
13. A variation on Boyer-Moore algorithm
14. A correct preprocessing algorithm for Boyer-Moore string searching
15. The complexity of pattern matching for a random string