scientific article; zbMATH DE number 1794216

zbMATH Open0992.68501MaRDI QIDQ4552402FDOQ4552402

Authors: Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot 

Publication date: 2 September 2002

Title of this publication is not available (Why is that?)

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

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)

Cited In (11)

• Substring search and repeat search using factor oracles
• On the Structure of Consistent Partitions of Substring Set of a Word
• Linear and efficient string matching algorithms based on weak factor recognition
• An algorithm to compute the character access count distribution for pattern matching algorithms
• General suffix automaton construction algorithm and space bounds
• Converting suffix trees into factor/suffix oracles
• A Bit-Parallel Exact String Matching Algorithm for Small Alphabet
• A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
• Constructing factor oracles
• Title not available (Why is that?)
• 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)