Burrows-Wheeler transform and LCP array construction in constant space (Q511147): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jda.2016.11.003 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3105423208 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1611.08198 / rank
 
Normal rank
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: Lightweight LCP Construction for Next-Generation Sequencing Datasets / 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: Linear time construction of compressed text indices in compact space / 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: Inducing Suffix and LCP Arrays in External Memory / 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: Computing the Burrows-Wheeler transform in place and in small space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal codeword sets and representations of the integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5485338 / 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: Wee LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inducing the LCP-Array / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combined data structure for previous- and next-smaller-values / rank
 
Normal rank
Property / cites work
 
Property / cites work: In-Place Suffix Sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and Lightweight LCP-Array Construction Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed suffix trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: LCP Array Construction in External Memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster External Memory LCP Array Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: LCP array construction using \(O(\operatorname{sort}(n))\) (or less) I/Os / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permuted Longest-Common-Prefix Array / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of elements to reorder when updating a suffix array / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the BWT and the LCP Array in Constant Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal suffix sorting and LCP array construction for constant alphabets / 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: Algorithm Theory - SWAT 2004 / 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: Optimal Dynamic Sequence Representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5397902 / 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: Q4828936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed suffix trees with full functionality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low space external memory construction of the succinct permuted longest common prefix array / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4833659 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JDA.2016.11.003 / rank
 
Normal rank

Latest revision as of 19:53, 9 December 2024

scientific article
Language Label Description Also known as
English
Burrows-Wheeler transform and LCP array construction in constant space
scientific article

    Statements

    Burrows-Wheeler transform and LCP array construction in constant space (English)
    0 references
    0 references
    0 references
    0 references
    14 February 2017
    0 references
    Burrows-Wheeler transform
    0 references
    LCP array
    0 references
    in-place algorithms
    0 references
    compressed LCP array
    0 references
    Elias coding
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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