Compressed property suffix trees

DOI10.1016/J.IC.2013.09.001MaRDI QIDQ386003zbMATH OpenOpenAlexFDO

Authors Wing-Kai Hon, Manish Patil, Rahul Shah, Sharma V. Thankachan

Publication date 13 December 2013

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2013.09.001

zbMATH Keywords

suffix treesproperty matchingproperty suffix tress

Mathematics Subject Classification ID

Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)

Recommendations

• The property suffix tree with dynamic properties
• The Property Suffix Tree with Dynamic Properties
• Faster index for property matching
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching

Cites work

• scientific article; zbMATH DE number 1512678 (Why is no real title available?)
• scientific article; zbMATH DE number 1830754 (Why is no real title available?)
• scientific article; zbMATH DE number 871936 (Why is no real title available?)
• A Framework for Dynamizing Succinct Data Structures
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• Alphabet-independent compressed text indexing
• An algorithmic framework for motif discovery problems in weighted sequences
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
• Compressed representations of sequences and full-text indexes
• Compressed suffix trees with full functionality
• Dynamic entropy-compressed sequences and full-text indexes
• Errata for ``Faster index for property matching
• Faster index for property matching
• Indexing compressed text
• Linear work suffix array construction
• Property matching and weighted matching
• Space-efficient preprocessing schemes for range minimum queries on static arrays
• Succinct data structures for searchable partial sums with optimal worst-case performance
• Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
• Suffix Arrays: A New Method for On-Line String Searches
• The Property Suffix Tree with Dynamic Properties
• The weighted suffix tree: an efficient data structure for handling molecular weighted sequences and its applications

Cited in

(6)

• Property Suffix Array with Applications in Indexing Weighted Sequences
• Property suffix array with applications
• Orthogonal range searching for text indexing
• Faster index for property matching
• The Property Suffix Tree with Dynamic Properties
• The property suffix tree with dynamic properties

This page was built for publication: Compressed property suffix trees

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