On the Structure of Consistent Partitions of Substring Set of a Word

DOI10.1007/978-3-642-02270-8_33zbMath1248.68176OpenAlexW1794623150MaRDI QIDQ5321725

Meng Zhang, Liang Hu, Peichen Xin, Yi Zhang

Publication date: 14 July 2009

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02270-8_33

Mathematics Subject Classification ID

Combinatorics on words (68R15) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ternary directed acyclic word graphs
• Compact directed acyclic word graphs for a sliding window
• The smallest automaton recognizing the subwords of a text
• Fast practical multi-pattern matching
• Transducers and repetitions
• On-line construction of suffix trees
• Suffix Arrays: A New Method for On-Line String Searches
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• THE STRUCTURE OF FACTOR ORACLES
• Algorithms on Strings, Trees and Sequences
• Combinatorial Pattern Matching
• Theory and Applications of Models of Computation

This page was built for publication: On the Structure of Consistent Partitions of Substring Set of a Word