Combinatorial Pattern Matching

DOI10.1007/B98377MaRDI QIDQ5315352zbMATH OpenFDO

Authors Ho-Leung Chan, Wing-Kai Hon, Tak-Wah Lam

Publication date 7 September 2005

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

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10)

Recommendations

• Compressed indexes for dynamic text collections
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• Dynamic dictionary matching and compressed suffix trees
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
• Improved Dynamic Text Indexing

Cited in

(8)

• Optimal prefix and suffix queries on texts
• Compressed Data Structures for Dynamic Sequences
• Dynamic rank/select structures with applications to run-length encoded texts
• Rank/select on dynamic compressed sequences and applications
• Dynamic dictionary matching and compressed suffix trees
• A compressed dynamic self-index for highly repetitive text collections
• Compressed Text Indexes with Fast Locate
• Compressed text indexing with wildcards

This page was built for publication: Combinatorial Pattern Matching

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