Efficient experimental string matching by weak factor recognition

DOI10.1007/3-540-48194-X_5MaRDI QIDQ4552402zbMATH OpenFDO

Authors Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot

Publication date 2 September 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48194-X_5

zbMATH Keywords

algorithm designfinite automatoninformation retrievalstring matching

Mathematics Subject Classification ID

Searching and sorting (68P10) Information storage and retrieval of data (68P20) Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• Factor oracle: A new structure for pattern matching
• Factor Oracles
• Constructing factor oracles
• THE STRUCTURE OF FACTOR ORACLES
• Linear and efficient string matching algorithms based on weak factor recognition

Cited in

(12)

• An algorithm to compute the character access count distribution for pattern matching algorithms
• scientific article; zbMATH DE number 6672736 (Why is no real title available?)
• Factor oracle: A new structure for pattern matching
• Linear and efficient string matching algorithms based on weak factor recognition
• Designing optimal- and fast-on-average pattern matching algorithms
• On the Structure of Consistent Partitions of Substring Set of a Word
• A Bit-Parallel Exact String Matching Algorithm for Small Alphabet
• Constructing factor oracles
• Substring search and repeat search using factor oracles
• General suffix automaton construction algorithm and space bounds
• Converting suffix trees into factor/suffix oracles
• A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms

This page was built for publication: Efficient experimental string matching by weak factor recognition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4552402)