Efficient detection of quasiperiodicities in strings
From MaRDI portal
(Redirected from Publication:688155)
Recommendations
Cites work
- scientific article; zbMATH DE number 3864532 (Why is no real title available?)
- scientific article; zbMATH DE number 3827234 (Why is no real title available?)
- scientific article; zbMATH DE number 3913711 (Why is no real title available?)
- scientific article; zbMATH DE number 3913712 (Why is no real title available?)
- scientific article; zbMATH DE number 3976360 (Why is no real title available?)
- scientific article; zbMATH DE number 3982538 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- A Space-Economical Suffix Tree Construction Algorithm
- A representation for linear lists with movable fingers
- An O(n log n) algorithm for finding all repetitions in a string
- An optimal algorithm for computing the repetitions in a word
- Factorizing words over an ordered alphabet
- On the computational power of pushdown automata
- Optimal off-line detection of repetitions in a string
- Optimal parallel detection of squares in strings
- Structural properties of the string statistics problem
- The equation \(a_ M=b^ Nc^ P\) in a free group
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
Cited in
(56)- Efficient algorithms for shortest partial seeds in words
- Efficient seed computation revisited
- Minimal critical exponent of quasiperiodic words
- Testing string superprimitivity in parallel
- A work-time optimal algorithm for computing all string covers
- scientific article; zbMATH DE number 1400047 (Why is no real title available?)
- scientific article; zbMATH DE number 1615297 (Why is no real title available?)
- String Covering: A Survey
- Quasi-periodicity under mismatch errors
- Quasiperiodic Sturmian words and morphisms
- Efficient Computation of 2-Covers of a String.
- The set of parameterized k-covers problem
- On left and right seeds of a string
- \(k\)-approximate quasiperiodicity under Hamming and edit distance
- On approximate enhanced covers under Hamming distance
- Optimality of some algorithms to detect quasiperiodicities
- Approximate cover of strings
- ALGORITHMS FOR APPROXIMATE K-COVERING OF STRINGS
- Can we recover the cover?
- scientific article; zbMATH DE number 1092948 (Why is no real title available?)
- Normal forms of quasiperiodic strings
- Computing regularities in strings: a survey
- Detecting leftmost maximal periodicities
- Finding the cyclic covers of a string
- Covering a string
- String covering with optimal covers
- The subsequence composition of a string
- Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties.
- Repetitive perhaps, but certainly not boring
- Enhanced string covering
- Quasiperiods of biinfinite words
- Quasiperiodicity and string covering
- Quasiperiodic and Lyndon episturmian words
- Experimental evaluation of algorithms for computing quasiperiods
- scientific article; zbMATH DE number 4078831 (Why is no real title available?)
- Optimal superprimitivity testing for strings
- String cadences
- An on-line string superprimitivity test
- Quasi-Periodicity in Streams
- An optimal algorithm to compute all the covers of a string
- scientific article; zbMATH DE number 1507240 (Why is no real title available?)
- Overlapping factors in words
- Internal Quasiperiod Queries
- Fast algorithm for partial covers in words
- Efficient seeds computation revisited
- Identifying all abelian periods of a string in quadratic time and relevant problems
- Period recovery of strings over the Hamming and edit distances
- Finding periods in Cartesian tree matching
- Collage of two-dimensional words
- scientific article; zbMATH DE number 1615296 (Why is no real title available?)
- Episturmian words: a survey
- Approximation and fixed parameter algorithms for the approximate cover problem
- String covers of a tree revisited
- Approximate periods of strings
- Coverability and multi-scale coverability on infinite pictures
- Coverability in two dimensions
This page was built for publication: Efficient detection of quasiperiodicities in strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688155)
