Faster entropy-bounded compressed suffix trees (Q1038474): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2009.09.012 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2154803978 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2009.09.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2154803978 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56768697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Replacing suffix trees with enhanced suffix arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearest common ancestors: a survey and a new algorithm for a distributed environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowest common ancestors in trees and directed acyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Star-Tree Parallel Data Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed indexes for dynamic text collections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Suffix trays and suffix trists: structures for faster text indexing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4910720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Patterns in Given Intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering the LOUDS Succinct Tree Representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed text indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed representations of sequences and full-text indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934654 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3104275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An(other) Entropy-Bounded Compressed Suffix Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple optimal representation for balanced parentheses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Lower Bounds for Rank and Select Indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed Text Indexes with Fast Locate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4428995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Construction of Suffix Arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space Efficient Linear Time Construction of Suffix Arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5708460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank and select revisited and extended / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of the Burrows—Wheeler transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space Efficient Suffix Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully-Compressed Suffix Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: New text indexing functionalities of the compressed suffix arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed suffix trees with full functionality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct data structures for flexible text retrieval systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors / rank
 
Normal rank

Latest revision as of 05:21, 2 July 2024

scientific article
Language Label Description Also known as
English
Faster entropy-bounded compressed suffix trees
scientific article

    Statements

    Faster entropy-bounded compressed suffix trees (English)
    0 references
    0 references
    0 references
    0 references
    18 November 2009
    0 references
    suffix trees
    0 references
    compressed data structures
    0 references
    range minimum queries
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers