Repetitions in strings: algorithms and combinatorics (Q1034529): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Optimal off-line detection of repetitions in a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Runs in Sturmian Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crochemore Factorization of Sturmian and Other Infinite Words / 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: The Lempel–Ziv Complexity of Fixed Points of Morphisms / 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: Transducers and repetitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Powers in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Maximal Repetitions in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal repetitions in 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: Towards a Solution to the “Runs” Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-way string-matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Squares, cubes, and time-space efficient string searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jewels of Stringology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repetitions in Sturmian strings / 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: AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space-optimal string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Not So Many Runs in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for finding and representing all the tandem repeats in a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof that a word of length \(n\) has at most \(2n\) distinct squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the number of squares in a word / 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: Q3912049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting leftmost maximal periodicities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n log n) algorithm for finding all repetitions in a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repetitions in the Fibonacci infinite word / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many runs can a string contain? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of subword graphs and suffix trees of Fibonacci words / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Runs in a String: Improved Analysis of the Linear Upper Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of runs in a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repetitive perhaps, but certainly not boring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing regularities in strings: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4833659 / rank
 
Normal rank

Revision as of 02:57, 2 July 2024

scientific article
Language Label Description Also known as
English
Repetitions in strings: algorithms and combinatorics
scientific article

    Statements

    Repetitions in strings: algorithms and combinatorics (English)
    0 references
    0 references
    0 references
    0 references
    6 November 2009
    0 references
    repetitions
    0 references
    squares
    0 references
    cubes
    0 references
    runs
    0 references
    consecutive repeats
    0 references
    tandem repeats
    0 references
    compression
    0 references
    factorisation
    0 references
    algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers