scientific article; zbMATH DE number 1794216

MaRDI QIDQ4552402zbMATH OpenFDO

Authors Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot

Publication date 2 September 2002

zbMATH Keywords

information retrievalstring matchingfinite automatonalgorithm design

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1490002
• Factor Oracles
• Constructing factor oracles
• THE STRUCTURE OF FACTOR ORACLES
• Linear and efficient string matching algorithms based on weak factor recognition

Cited in

(11)

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

This page was built for publication:

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