Approximate periods of strings

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

Volumn 1645, Issue , 1999, Pages 123-133

  Sim, Jeong Seop ^a   Iliopoulos, Costas S ^b,d   Park, Kunsoo ^a   Smyth, William F ^c,d  

^a Seoul National University   (South Korea)

^b KING'S COLLEGE LONDON   (United Kingdom)

^c MCMASTER UNIVERSITY   (Canada)

^d CURTIN UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

MOLECULAR BIOLOGY; PATTERN MATCHING; POLYNOMIAL APPROXIMATION;

APPROXIMATE PERIOD; COMPUTER ASSISTED MUSIC ANALYSIS; DIVERSE APPLICATIONS; NP COMPLETE; POLYNOMIAL-TIME ALGORITHMS;

COMPUTER AIDED ANALYSIS;

EID: 84957618969     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48452-3_10     Document Type: Conference Paper

References (30)

1. A. Apostolico and D. Breslauer, An optimal O(log logN)-time parallel algorithm for detecting all squares in a string, SIAM Journal on Computing 25, 6 (1996), 1318-1331.
2. A. Apostolico, D. Breslauer and Z. Galil, Optimal parallel algorithms for periods, palindromes and squares, Proc. 19th Int. Colloq. Automata Languages and Programming, Lecture Notes in Computer Science 623 (1992), 296-307.
3. A. Apostolico and A. Ehrenfeucht, Effcient detection of quasiperiodicities in strings, Theoretical Computer Science 119, 2(1993), 247-265.
4. A. Apostolico, M. Farach and C.S. Iliopoulos, Optimal superprimitivity testing for strings, Information Processing Letters 39, 1 (1991), 17-20.
5. A. Apostolico, F.P. Preparata, Optimal off-line detection of repetitions in a string, Theoretical Computer Science 22, (1983), 297-315.
6. O. Berkman, C.S. Iliopoulos and K. Park, The subtree max gap problem with application to parallel string covering, Information and Computation 123, 1 (1995), 127-137.
7. D. Breslauer, An on-line string superprimitivity test, Information Processing Let- ters 44 (1992), 345-347.
8. D. Breslauer, Testing string superprimitivity in parallel, Information Processing Letters 49, 5 (1994), 235-241.
9. T. Crawford, C.S. Iliopoulos and R. Raman, String Matching Techniques for Musical Similarity and Melodic Recognition, Computing in Musicology, 11 (1998), 73-100.
10. M. Crochemore, An optimal algorithm for computing the repetitions in a word, Information Processing Letters 12, 5 (1981), 244-250.
11. M. Crochemore, C.S. Iliopoulos and M. Korda, Two-dimensional Pre_x String Matching and Covering on Square Matrices, Algorithmica 20 (1998), 353-373.
12. M. Crochemore, C.S. Iliopoulos and H. Yu, Algorithms for computing evolutionary chains in molecular and musical sequences, Proc. 9th Australasian Workshop on Combinatorial Algorithms (1998), 172-185.
13. C.S. Iliopoulos and M. Korda, Optimal parallel superprimitivity testing on square arrays, Parallel Processing Letters 6, 3 (1996), 299-308.
14. C.S. Iliopoulos, D.W.G. Moore and K. Park, Covering a string, Algorithmica 16 (1996), 288-297.
15. C.S. Iliopoulos and L. Mouchard, An O(n log n) algorithm for computing all maximal quasiperiodicities in strings, to appear in the Proceedings of CATS'99: "Computing: Australasian Theory Symposium", Auckland, New Zealand, Lecture Notes in Computer Science (1999), 262-272.
16. C.S. Iliopoulos and K. Park, A work-time optimal algorithm for computing all string covers, Theoretical Computer Science 164 (1996), 299-310.
17. C.S. Iliopoulos and K. Park, An optimal O(log log n)-time algorithm for parallel superprimitivity testing, J. Korea Inform. Sci. Soc. 21 (1994), 1400-1404.
18. C.S. Iliopoulos and W.F. Smyth, On-line algorithms for k-covering, Proc. 9th Aus- tralasian Workshop on Combinatorial Algorithms (1998), 97-106.
19. D.E. Knuth, J.H. Morris and V.R. Pratt, Fast pattern matching in strings, SIAM Journal on Computing 6, 1 (1977), 323-350.
20. G.M. Landau, E.W. Myers and J.P. Schmidt, Incremental string comparison, SIAM Journal on Computing 27, 2 (1998), 557-582.
21. G.M. Landau and J.P. Schmidt, An algorithm for approximate tandem repeats, Proc. 4th Symp. Combinatorial Pattern Matching, Lecture Notes in Computer Science 648 (1993), 120-133.
22. Y. Li and W.F. Smyth, An optimal on-line algorithm to compute all the covers of a string, preprint.
23. D. Maier, The complexity of some problems on subsequences and supersequences, J. Assoc. Comput. Mach. 25 (1978), 322-336.
24. M.G. Main and R.J. Lorentz, An algorithm for finding all repetitions in a string, Journal of Algorithms 5 (1984), 422-432.
25. M. Middendorf, More on the complexity of common superstring and supersequence problems, Theoretical Computer Science 125, 2 (1994), 205-228.
26. D. Moore and W.F. Smyth, A correction to "An optimal algorithm to compute all the covers of a string.", Information Processing Letters 54, 2 (1995), 101-103.
27. K.J. Räihä and E. Ukkonen, The shortest common supersequence problem over binary alphabet is NP-complete. Theoretical Computer Science 16 (1981), 187-198.
28. J.P. Schmidt, All highest scoring paths in weighted grid graphs and its application to finding all approximate repeats in strings, SIAM Journal on Computing 27, 4 (1998), 972-992.
29. P.H. Sellers, Pattern recognition genetic sequences by mismatch density, Bulletin of Mathematical Biology 46, 4 (1984), 501-514.
30. L. Wang and T. Jiang, On the complexity of multiple sequence alignment, J. Comp. Biol. 1 (1994), 337-348.