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

DOI10.1007/978-3-642-02270-8_33MaRDI QIDQ5321725zbMATH OpenOpenAlexFDO

Authors Meng Zhang, Yi Zhang, Liang Hu, Peichen Xin

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

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

Recommendations

• Weighted automata for full-text indexing
• Combinatorial Pattern Matching
• scientific article; zbMATH DE number 1786457
• scientific article; zbMATH DE number 2087051
• On-line construction of compact directed acyclic word graphs

Cites work

• Algorithms on Strings, Trees and Sequences
• Combinatorial Pattern Matching
• Compact directed acyclic word graphs for a sliding window
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• Fast practical multi-pattern matching
• scientific article; zbMATH DE number 3883638 (Why is no real title available?)
• scientific article; zbMATH DE number 5725179 (Why is no real title available?)
• scientific article; zbMATH DE number 1794216 (Why is no real title available?)
• On-line construction of suffix trees
• Suffix Arrays: A New Method for On-Line String Searches
• Ternary directed acyclic word graphs
• The smallest automaton recognizing the subwords of a text
• THE STRUCTURE OF FACTOR ORACLES
• Theory and Applications of Models of Computation
• Transducers and repetitions

Cited in

(3)

• Counting subwords in a partition of a set
• Weighted automata for full-text indexing
• Combinatorial Pattern Matching

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

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