Efficient detection of quasiperiodicities in strings
From MaRDI portal
Publication:688155
DOI10.1016/0304-3975(93)90159-QzbMATH Open0804.68109MaRDI QIDQ688155FDOQ688155
Authors: Alberto Apostolico, Andrzej Ehrenfeucht 
Publication date: 28 November 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Factorizing words over an ordered alphabet
- Title not available (Why is that?)
- On the computational power of pushdown automata
- The equation \(a_ M=b^ Nc^ P\) in a free group
- An optimal algorithm for computing the repetitions in a word
- Optimal off-line detection of repetitions in a string
- A Space-Economical Suffix Tree Construction Algorithm
- Title not available (Why is that?)
- An O(n log n) algorithm for finding all repetitions in a string
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Structural properties of the string statistics problem
- Optimal parallel detection of squares in strings
- Title not available (Why is that?)
- A representation for linear lists with movable fingers
Cited In (56)
- Efficient seed computation revisited
- Minimal critical exponent of quasiperiodic words
- Title not available (Why is that?)
- Testing string superprimitivity in parallel
- A work-time optimal algorithm for computing all string covers
- Title not available (Why is that?)
- String Covering: A Survey
- Quasi-periodicity under mismatch errors
- Efficient Computation of 2-Covers of a String.
- Quasiperiodic Sturmian words and morphisms
- On left and right seeds of a string
- \(k\)-approximate quasiperiodicity under Hamming and edit distance
- The set of parameterized \(k\)-covers problem
- ALGORITHMS FOR APPROXIMATE K-COVERING OF STRINGS
- On approximate enhanced covers under Hamming distance
- Approximate cover of strings
- Optimality of some algorithms to detect quasiperiodicities
- Title not available (Why is that?)
- Can we recover the cover?
- Normal forms of quasiperiodic strings
- Computing regularities in strings: a survey
- Finding the cyclic covers of a string
- Detecting leftmost maximal periodicities
- Covering a string
- String covering with optimal covers
- Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties.
- The subsequence composition of a string
- Repetitive perhaps, but certainly not boring
- Enhanced string covering
- Quasiperiods of biinfinite words
- Quasiperiodic and Lyndon episturmian words
- Quasiperiodicity and string covering
- Experimental evaluation of algorithms for computing quasiperiods
- Title not available (Why is that?)
- Optimal superprimitivity testing for strings
- Quasi-Periodicity in Streams
- String cadences
- An on-line string superprimitivity test
- An optimal algorithm to compute all the covers of a string
- Title not available (Why is that?)
- Overlapping factors in words
- 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
- Episturmian words: a survey
- Approximate periods of strings
- Title not available (Why is that?)
- Coverability in two dimensions
- Coverability and multi-scale coverability on infinite pictures
- Efficient algorithms for shortest partial seeds in words
- Internal Quasiperiod Queries
- Approximation and fixed parameter algorithms for the approximate cover problem
- String covers of a tree revisited
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)
