Faster Compressed Suffix Trees for Repetitive Collections (Q5266617): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Practical compressed suffix trees / 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: Q3690245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Trees in Practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-Indexed Grammar-Based Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theoretical and experimental study on the construction of suffix arrays in external memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better external memory suffix array construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Relative Lempel-Ziv Self-index for Similar Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lightweight data indexing and compression in external memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The string B-tree / 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: Wee LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster entropy-bounded compressed suffix trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Grammar-Based Self-index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering a lightweight external memory suffix array construction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: LCP Array Construction in External Memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4428995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On compressing and indexing repetitive sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Suffix Arrays: A New Method for On-Line String Searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computation Structures / 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: A Space-Economical Suffix Tree Construction Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Suffix Tree of Alignment: An Efficient Index for Similar Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indexing Highly Repetitive Collections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Compressed Suffix Trees for Repetitive Collections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grammar compressed sequences with rank/select support / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental algorithms. 10th international symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5--7, 2011. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Functional Static and Dynamic Succinct Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5397902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully compressed suffix trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed suffix trees with full functionality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully linear-time approximation algorithm for grammar-based compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Succinct Grammar Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line construction of suffix trees / rank
 
Normal rank

Latest revision as of 00:35, 14 July 2024

scientific article; zbMATH DE number 6732202
Language Label Description Also known as
English
Faster Compressed Suffix Trees for Repetitive Collections
scientific article; zbMATH DE number 6732202

    Statements

    Faster Compressed Suffix Trees for Repetitive Collections (English)
    0 references
    0 references
    16 June 2017
    0 references
    0 references
    grammar-compressed trees
    0 references
    bioinformatics
    0 references
    repetitive sequence collections
    0 references
    suffix trees
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references