Solving the string statistics problem in time O(n log n)

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

Volumn 2380 LNCS, Issue , 2002, Pages 728-739

  Brodal, Gerth Stølting ^a   Lyngsø, Rune B ^b   Östlin, Anna ^a   Pedersen, Christian N S ^a  

^a AARHUS UNIVERSITY   (Denmark)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; FORESTRY; TREES (MATHEMATICS);

CONSTRUCTION TIME; IT SUPPORTS; QUERY PATTERNS; REFINED ANALYSIS; SEARCH TREES; SIMPSON; SUFFIX-TREES;

QUERY PROCESSING;

EID: 84869200621     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_62     Document Type: Conference Paper

References (19)

1. A. Apostolico and A. Ehrenfeucht. Efficient detection of quasiperiodicities in strings. Theoretical Computer Science, 119:247-265, 1993.
2. A. Apostolico and F. P. Preparata. Optimal off-line detection of repetitions in a string. Theoretical Computer Science, 22:297-315, 1983.
3. A. Apostolico and F. P. Preparata. Data structures and algorithms for the string statistics problem. Algorithmica, 15:481-494, 1996.
4. G. S. Brodal, R. Lyngsø, C. N. S. Pedersen, and J. Stoye. Finding maximal pairs with bounded gap. Journal of Discrete Algorithms, Special Issue of Matching Patterns, 1(1):77-104, 2000.
5. G. S. Brodal, R. B. Lyngsø, A. Östlin, and C. N. S. Pedersen. Solvingthe string statistics problem in time O(n log n). Technical Report RS-02-13, BRICS, Department of Computer Science, University of Aarhus, 2002.
6. G. S. Brodal and C. N. S. Pedersen. Findingmaximal quasiperiodicities in strings. In Proc. 11th Combinatorial Pattern Matching, volume 1848 of Lecture Notes in Computer Science, pages 397-411. Springer Verlag, Berlin, 2000.
7. M. R. Brown and R. E. Tarjan. A fast merging algorithm. Journal of the ACM, 26(2):211-226, 1979.
8. M. Farach. Optimal suffix tree construction with large alphabets. In Proc. 38th Ann. Symp. on Foundations of Computer Science (FOCS), pages 137-143, 1997.
9. A. S. Fraenkel and J. Simpson. How many squares can a stringcon tain? Journal of Combinatorial Theory, Series A, 82(1):112-120, 1998.
10. D. Gusfield. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997.
11. K. Hoffmann, K. Mehlhorn, P. Rosenstiehl, and R. E. Tarjan. SortingJordan sequences in linear time usinglev el-linked search trees. Information and Control, 86(1-3):170-184, 1986.
12. S. Huddleston and K. Mehlhorn. A new data structure for representingsorted lists. Acta Informatica, 17:157-184, 1982.
13. F. K. Hwang and S. Lin. A simple algorithm for merging two disjoint linearly ordered sets. SIAM Journal of Computing, 1(1):31-39, 1972.
14. D. E. Knuth, J. H. Morris, and V. R. Pratt. Fast pattern matchingin strings. SIAM Journal of Computing, 6:323-350, 1977.
15. E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23(2):262-272, 1976.
16. K. Mehlhorn. Sorting and Searching, volume 1 of Data Structures and Algorithms. Springer Verlag, Berlin, 1984.
17. J. Stoye and D. Gusfield. Simple and flexible detection of contiguous repeats using a suffix tree. Theoretical Computer Science, 270:843-856, 2002.
18. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14:249-260, 1995.
19. P. Weiner. Linear pattern matchingalg orithms. In Proc. 14th Symposium on Switching and Automata Theory, pages 1-11, 1973.