Extracting powers and periods in a word from its runs structure
Authors:
- M. CrochemoreMCM. Crochemore
- C.S. IliopoulosCIC.S. Iliopoulos
- M. KubicaMKM. Kubica
- J. RadoszewskiJRJ. Radoszewski
- W. RytterWRW. Rytter
- T. WaleńTWT. Waleń
- 1 February 2014
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 521, 29-41
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- The “runs” conjectureTheoretical Computer Science, 2011
- Repetitions in strings: Algorithms and combinatoricsTheoretical Computer Science, 2009
- A note on the number of squares in a wordTheoretical Computer Science, 2007
- A simple proof that a word of length n has at most 2n distinct squaresJournal of Combinatorial Theory, Series A, 2005
- Linear time algorithms for finding and representing all the tandem repeats in a stringJournal of Computer and System Sciences, 2004
- Linear-time computation of local periodsTheoretical Computer Science, 2004
- How Many Squares Can a String Contain?Journal of Combinatorial Theory, Series A, 1998
- Detecting leftmost maximal periodicitiesDiscrete Applied Mathematics, 1989
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984