The number of runs in a string: Improved analysis of the linear upper bound

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3884 LNCS, Issue , 2006, Pages 184-195

  Rytter, Wojciech ^a,b  

^a UNIVERSITY OF WARSAW   (Poland)

^b University Heights   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT COEFFICIENT; INCLUSION-MAXIMAL PERIODIC SEGMENT; LINEAR UPPER BOUND; PERIODICITY LEMMAS;

ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY; THEOREM PROVING;

LINEAR ALGEBRA;

EID: 33745594562     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11672142_14     Document Type: Conference Paper

References (13)

1. M. Crochemore, An optimal algorithm for computing the repetitions in a word, Inf. Proc. Letters 42:5(1981) 244-250
2. F. Franck, R.J.Simpson, W.F.Smyth, The maximum number of runs in a string, Proc. 14-th Australian Workshop on Combinatorial Algorithms, M.Miller, K. Park (editors) (2003) 26-35
3. M. Crochemore, W.Rytter, Jewels of stringology: text algorithms, World Scientific 2003
4. Kangmin Fan, William F. Smyth, R. J. Simpson: A New Periodicity Lemma. CPM 2005: 257-265
5. F. Franek, A. Karaman, W.F.Smyth, Repetitions in Sturmian strings, TCS 249-2 (2000) 289-303
6. C. Iliopoulos, D. Moore, W.F.Smyth, A characterization of the squares in a Fibonacci string, TCS 172 (1997) 281-291
7. R.Kolpakov, G.Kucherov, On maximal repetitions in words, Journal of Discr. Algorithms 1 (2000) 159-186
8. R.Kolpakov, G.Kucherov, Finding maximal repetitions in a word in linear time, FOCS (1999) 596-604
9. Lothaire, Algebraic combinatorics on words, Cambridge University Press
10. M.G.Main, R.J.Lorentz, An O(n log n) algorithm for finding all repetitions in a string, Journal of Algorithms 5 (1984) 422-432
11. W.Rytter, The structure of subword graphs and suffix trees of Fibonacci words, in Colloquium on Implementation and Application of Automata, CIAA (2005)
12. W.F.Smyth, Computing patterns in strings, Addison-Wesley (2003)
13. W.F.Smyth, Repetitive perhaps, but certainly not boring, TCS 249-2 (2000) 343-355.