Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies (Q5270943): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1145/3035540 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2582314531 / 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: Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies / 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: Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parallel Evaluation of General Arithmetic Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5485338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Succinctness for Range Minimum Queries / 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: Faster entropy-bounded compressed suffix trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023519 / 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: Parallel External Memory Suffix Sorting / 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: Parallel lightweight wavelet tree, suffix array and FM-index construction / 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: Q3138909 / 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: Q5397902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Compressed Enhanced Suffix Array Supporting Fast String Matching / 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: A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering a compressed suffix tree implementation / rank
 
Normal rank

Latest revision as of 01:28, 14 July 2024

scientific article; zbMATH DE number 6738466
Language Label Description Also known as
English
Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies
scientific article; zbMATH DE number 6738466

    Statements

    Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies (English)
    0 references
    0 references
    0 references
    0 references
    3 July 2017
    0 references
    algorithm engineering
    0 references
    balanced parentheses sequence
    0 references
    compressed text index
    0 references
    parallel algorithms
    0 references
    succinct tree representation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers