Computing regularities in strings: a survey
type: Item
instance of: scholarly article
title: Computing regularities in strings: a survey
zbMATH Open document ID: 1253.68277
author: W. F. Smyth
published in: European Journal of Combinatorics
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 6106890
zbMATH Keywords: sequencial algorithms
describes a project that uses: libdivsufsort
MaRDI profile type: Publication
full work available at URL: j.ejc.2012.07.010
OpenAlex ID: W1969885991
cites work: Replacing suffix trees with enhanced suffix arrays
cites work: Pattern matching in compressed texts and images
cites work: Q4091421
cites work: A comparison of index-based Lempel-Ziv LZ77 factorization algorithms
cites work: Q3690245
cites work: Efficient detection of quasiperiodicities in strings
cites work: Optimal superprimitivity testing for strings
cites work: Optimal off-line detection of repetitions in a string
cites work: Partial words and a theorem of Fine and Wilf
cites work: Algorithmic Combinatorics on Partial Words
cites work: An on-line string superprimitivity test
cites work: Q2723969
cites work: Fast and Practical Algorithms for Computing All the Runs in a String
cites work: Lempel-Ziv factorization using less time \& space
cites work: On the Right-Seed Array of a String
cites work: Efficient Seeds Computation Revisited
cites work: Q5446124
cites work: An optimal algorithm for computing the repetitions in a word
cites work: Computing longest previous factor in linear time and applications
cites work: Maximal repetitions in strings
cites work: LPF Computation Revisited
cites work: Towards a Solution to the “Runs” Conjecture
cites work: Squares, cubes, and time-space efficient string searching
cites work: Q4351065
cites work: A New Periodicity Lemma
cites work: Algorithms for computing abelian periods of words
cites work: Uniqueness Theorems for Periodic Functions
cites work: More results on overlapping squares
cites work: Q4820870
cites work: Q4820869
cites work: Q4454546
cites work: Not So Many Runs in Strings
cites work: Optimality of some algorithms to detect quasiperiodicities
cites work: Computing the λ-Seeds of a String
cites work: Computing the \(\lambda \)-covers of a string
cites work: Algorithms on Strings, Trees and Sequences
cites work: Minimum Unique Substrings and Maximum Repeats
cites work: A FIRST APPROACH TO FINDING COMMON MOTIFS WITH GAPS
cites work: Q4454548
cites work: New complexity results for the \(k\)-covers problem
cites work: Covering a string
cites work: Q4939600
cites work: A new approach to pattern matching in degenerate DNA/RNA sequences and distributed pattern matching
cites work: Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences
cites work: Permuted Longest-Common-Prefix Array
cites work: Q4449231
cites work: Q4547749
cites work: Linear-Time Construction of Suffix Arrays
cites work: Fast Pattern Matching in Strings
cites work: Space Efficient Linear Time Construction of Suffix Arrays
cites work: A Linear-Time Algorithm for Seeds Computation
cites work: Q4934345
cites work: The three squares lemma revisited
cites work: On the Complexity of Finite Sequences
cites work: Computing the cover array in linear time
cites work: Q4341774
cites work: Detecting leftmost maximal periodicities
cites work: An O(n log n) algorithm for finding all repetitions in a string
cites work: Q3138909
cites work: Suffix Arrays: A New Method for On-Line String Searches
cites work: Algorithm Theory - SWAT 2004
cites work: A Space-Economical Suffix Tree Construction Algorithm
cites work: An optimal algorithm to compute all the covers of a string
cites work: Efficient Computation of Substring Equivalence Classes with Suffix Arrays
cites work: Linear Time Suffix Array Construction Using D-Critical Substrings
cites work: An Online Algorithm for Finding the Longest Previous Factors

Computing regularities in strings: a survey (cites work)
cites work: Q5503342

Computing regularities in strings: a survey (cites work)
cites work: How many runs can a string contain?

Computing regularities in strings: a survey (cites work)
cites work: Fast, practical algorithms for computing all the repeats in a string

Computing regularities in strings: a survey (cites work)
cites work: Space-Time Tradeoffs for Longest-Common-Prefix Array Computation

Computing regularities in strings: a survey (cites work)
cites work: The Number of Runs in a String: Improved Analysis of the Linear Upper Bound

Computing regularities in strings: a survey (cites work)
cites work: Intersecting periodic words

Computing regularities in strings: a survey (cites work)
cites work: Q3565863

Computing regularities in strings: a survey (cites work)
cites work: Repetitive perhaps, but certainly not boring

Computing regularities in strings: a survey (cites work)
cites work: A new approach to the periodicity lemma on strings with holes

Computing regularities in strings: a survey (cites work)
cites work: On-line construction of suffix trees

Computing regularities in strings: a survey (cites work)
cites work: A universal algorithm for sequential data compression

Computing regularities in strings: a survey (DOI)
DOI: 10.1016/J.EJC.2012.07.010