The number of runs in a string
Author:
- 1 September 2007
- journal article
- Published by Elsevier in Information and Computation
- Vol. 205 (9) , 1459-1469
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The structure of subword graphs and suffix trees of Fibonacci wordsTheoretical Computer Science, 2006
- The Number of Runs in a String: Improved Analysis of the Linear Upper BoundLecture Notes in Computer Science, 2006
- Repetitive perhaps, but certainly not boringTheoretical Computer Science, 2000
- Repetitions in Sturmian stringsTheoretical Computer Science, 2000
- A characterization of the squares in a Fibonacci stringTheoretical Computer Science, 1997
- Transducers and repetitionsTheoretical Computer Science, 1986
- An O(n log n) algorithm for finding all repetitions in a stringJournal of Algorithms, 1984
- An optimal algorithm for computing the repetitions in a wordInformation Processing Letters, 1981