Compressed property suffix trees

DOI10.1016/J.IC.2013.09.001zbMATH Open1435.68399OpenAlexW2055638053MaRDI QIDQ386003FDOQ386003

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

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

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)

Cites Work

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

Cited In (6)

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

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)