Space-efficient construction of compressed suffix trees (Q2220837): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2020.11.024 / rank
Normal rank
 
Property / cites work
 
Property / cites work: An extension of the Burrows-Wheeler transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lightweight algorithms for constructing and inverting the BWT of string collections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast BWT in small space by blockwise suffix sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Dynamic Sequence Representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lightweight LCP construction for very large collections of strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting Mutations by eBWT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lightweight metagenomic classification via eBWT / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for the all-pairs suffix-prefix problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547749 / 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: Compressed suffix trees with full functionality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divide and conquer computation of the multi-string BWT and LCP array / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time construction of compressed text indices in compact space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permuted Longest-Common-Prefix Array / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering a compressed suffix tree implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the longest common prefix array based on the Burrows-Wheeler transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing trees of higher degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking a Time-and-Space Barrier in Constructing Full-Text Indices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-Time Tradeoffs for Longest-Common-Prefix Array Computation / 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: Wavelet trees for all / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alphabet-Independent Compressed Text Indexing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lightweight BWT and LCP Merging via the Gap Algorithm / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2020.11.024 / rank
 
Normal rank

Latest revision as of 13:20, 17 December 2024

scientific article
Language Label Description Also known as
English
Space-efficient construction of compressed suffix trees
scientific article

    Statements

    Space-efficient construction of compressed suffix trees (English)
    0 references
    0 references
    0 references
    25 January 2021
    0 references
    Burrows-Wheeler transform
    0 references
    compressed suffix tree
    0 references
    LCP
    0 references
    PLCP
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references