A Linear-Time Algorithm for Seeds Computation (Q4987445): Difference between revisions

From MaRDI portal
Merged Item from Q5743460
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient detection of quasiperiodicities in strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal superprimitivity testing for strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The subtree max gap problem with application to parallel string covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: An on-line string superprimitivity test / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5446122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Seeds Computation Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5446124 / 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: Efficient algorithms for three variants of the LPF table / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jewels of Stringology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing longest previous non-overlapping factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for a special case of disjoint set union / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the λ-Seeds of a String / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the \(\lambda \)-covers of a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank
 
Normal rank
Property / cites work
 
Property / cites work: New complexity results for the \(k\)-covers problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4939600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the cover array in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting leftmost maximal periodicities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repetitive perhaps, but certainly not boring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal algorithm for sequential data compression / rank
 
Normal rank

Latest revision as of 05:11, 19 July 2024

scientific article; zbMATH DE number 7053338
Language Label Description Also known as
English
A Linear-Time Algorithm for Seeds Computation
scientific article; zbMATH DE number 7053338

    Statements

    A Linear-Time Algorithm for Seeds Computation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    3 May 2021
    0 references
    10 May 2019
    0 references
    seed of a word
    0 references
    quasiperiodicity
    0 references
    subword complexity
    0 references
    suffix tree
    0 references

    Identifiers

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