Optimality of some algorithms to detect quasiperiodicities
From MaRDI portal
Publication:986546
DOI10.1016/J.TCS.2010.04.039zbMATH Open1196.68178OpenAlexW2028897973MaRDI QIDQ986546FDOQ986546
Authors: Richard Groult, Gwénaël Richomme 
Publication date: 11 August 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.04.039
Recommendations
- scientific article
- scientific article; zbMATH DE number 1438873
- Experimental evaluation of algorithms for computing quasiperiods
- Publication:4939600
- Publication:4867138
- scientific article; zbMATH DE number 1855595
- Optimal detection of a recurring tuple of reference fragments in a quasiperiodic sequence
- scientific article
- A posteriori detection of a quasiperiodic fragment with a given number of repetitions in a numerical sequence
- An Optimal Algorithm for Detecting Pseudo-squares
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- An optimal algorithm for computing the repetitions in a word
- Title not available (Why is that?)
- Algorithms on Strings
- An on-line string superprimitivity test
- How many squares can a string contain?
- An optimal algorithm to compute all the covers of a string
- Computing the cover array in linear time
- Optimal superprimitivity testing for strings
- Title not available (Why is that?)
- On extremal properties of the Fibonacci word
- Efficient detection of quasiperiodicities in strings
- Quasiperiodic and Lyndon episturmian words
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quasiperiodic Sturmian words and morphisms
- A characterization of the squares in a Fibonacci string
- Testing string superprimitivity in parallel
- The exact number of squares in Fibonacci words
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- Title not available (Why is that?)
- Computing regularities in strings: a survey
- Title not available (Why is that?)
- Experimental evaluation of algorithms for computing quasiperiods
- First-hit analysis of algorithms for computing quadratic irregularity
- Overlapping factors in words
- Title not available (Why is that?)
- Crochemore's partitioning on weighted strings and applications
This page was built for publication: Optimality of some algorithms to detect quasiperiodicities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q986546)
