Computing longest previous non-overlapping factors (Q1944092): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Crochemore Factorization of Sturmian and Other Infinite Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transducers and repetitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on 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: LPF Computation Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820870 / 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: Detecting leftmost maximal periodicities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal algorithm for sequential data compression / rank
 
Normal rank

Latest revision as of 08:38, 6 July 2024

scientific article
Language Label Description Also known as
English
Computing longest previous non-overlapping factors
scientific article

    Statements

    Computing longest previous non-overlapping factors (English)
    0 references
    0 references
    0 references
    4 April 2013
    0 references
    design of algorithms
    0 references
    longest previous factor
    0 references
    suffix array
    0 references
    Ziv-Lempel factorisation
    0 references
    text compression
    0 references
    detection of repetitions
    0 references

    Identifiers