Detecting leftmost maximal periodicities
From MaRDI portal
Publication:1825029
DOI10.1016/0166-218X(89)90051-6zbMath0683.68033OpenAlexW2007378578WikidataQ128090050 ScholiaQ128090050MaRDI QIDQ1825029
Publication date: 1989
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(89)90051-6
Related Items
A fast algorithm for finding the positions of all squares in a run-length encoded string, More results on overlapping squares, ASYMPTOTIC BEHAVIOUR OF THE MAXIMAL NUMBER OF SQUARES IN STANDARD STURMIAN WORDS, Distinct squares in run-length encoded strings, Locating maximal approximate runs in a string, Extracting powers and periods in a word from its runs structure, On Prefix/Suffix-Square Free Words, Variations of the parameterized longest previous factor, Large-scale detection of repetitions, Towards a Solution to the “Runs” Conjecture, Finding approximate repetitions under Hamming distance., On the structure of run-maximal strings, The three squares lemma revisited, Efficient algorithms for three variants of the LPF table, Computing longest previous non-overlapping factors, Computing runs on a general alphabet, Parameterized longest previous factor, Speeding up the detection of tandem repeats over the edit distance, AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING, Bounds on Powers in Strings, Maximal repetitions in strings, WORD COMPLEXITY AND REPETITIONS IN WORDS, How many runs can a string contain?, A \(d\)-step approach to the maximum number of distinct squares and runs in strings, Computing longest previous factor in linear time and applications, Computing regularities in strings: a survey, Computing the longest previous factor, On the maximum number of cubic subwords in a word, Linear time algorithms for finding and representing all the tandem repeats in a string, The ``runs conjecture, New complexity results for the \(k\)-covers problem, Linear-time computation of local periods, NUMBER OF OCCURRENCES OF POWERS IN STRINGS, Lempel-Ziv factorization powered by space efficient suffix trees, Detecting regularities on grammar-compressed strings, A brief history of parameterized matching problems, A Linear-Time Algorithm for Seeds Computation, Repetitions in strings: algorithms and combinatorics, Two-pattern strings. I: A recognition algorithm, More properties of the Fibonacci word on an infinite alphabet, Almost linear time computation of maximal repetitions in run length encoded strings, Three overlapping squares: the general case characterized \& applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Every iterated morphism yields a co-CFL
- Avoidable patterns in strings of symbols
- An optimal algorithm for computing the repetitions in a word
- Optimal off-line detection of repetitions in a string
- Bounded AFLs
- An O(n log n) algorithm for finding all repetitions in a string
- An “Interchange Lemma” for Context-Free Languages
- A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
- A Space-Economical Suffix Tree Construction Algorithm
- Real-time recognition of substring repetition and reversal
- A Linear-Time On-Line Recognition Algorithm for ``Palstar
- Fast Pattern Matching in Strings
