Faster online computation of the succinct longest previous factor array (Q2106621): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1007/978-3-030-51466-2_31 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3037189737 / 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: Succinct Partial Sums and Fenwick Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path Minima Queries in Dynamic Weighted Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and Practical Algorithms for Computing All the Runs in a String / 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 longest previous factor in linear time and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the longest previous factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient dynamic range minimum query / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct data structures for searchable partial sums with optimal worst-case performance / 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: Suffix Arrays: A New Method for On-Line String Searches / 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: Compressed Data Structures for Dynamic Sequences / 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: An Online Algorithm for Finding the Longest Previous Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: From LZ77 to the run-length encoded burrows-wheeler transform, and back / 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: A universal algorithm for sequential data compression / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:02, 31 July 2024

scientific article
Language Label Description Also known as
English
Faster online computation of the succinct longest previous factor array
scientific article

    Statements

    Faster online computation of the succinct longest previous factor array (English)
    0 references
    0 references
    0 references
    16 December 2022
    0 references
    longest previous factor
    0 references
    online
    0 references
    compressed data structures
    0 references

    Identifiers