Optimality of some algorithms to detect quasiperiodicities (Q986546): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4552045 / rank
 
Normal rank
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: An on-line string superprimitivity test / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing string superprimitivity in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extremal properties of the Fibonacci word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for computing the repetitions in a word / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many squares can a string contain? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The exact number of squares in Fibonacci words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasiperiodic and Lyndon episturmian words / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the squares in a Fibonacci string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4387730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4939600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasiperiodic Sturmian words and morphisms / 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: Q3659988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm to compute all the covers of a string / rank
 
Normal rank

Revision as of 01:30, 3 July 2024

scientific article
Language Label Description Also known as
English
Optimality of some algorithms to detect quasiperiodicities
scientific article

    Statements

    Optimality of some algorithms to detect quasiperiodicities (English)
    0 references
    11 August 2010
    0 references
    repetitions in words
    0 references
    quasiperiodicity
    0 references
    Fibonacci words
    0 references
    0 references
    0 references

    Identifiers