Approximate periods of strings

Theoretical Computer Science

Volumn 262, Issue 1-2, 2001, Pages 557-568

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

^a Seoul National University   (South Korea)

^b KING'S COLLEGE LONDON   (United Kingdom)

^c CURTIN UNIVERSITY   (Australia)

^d MCMASTER UNIVERSITY   (Canada)

Author keywords

Approximate periods; Distance function; Periodicity; Repetitions

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; FUNCTIONS;

APPROXIMATE PERIODS; PERIODICITY; REPETITIONS;

COMPUTER SCIENCE;

EID: 0034916536     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00365-0     Document Type: Article

References (32)

1. An optimal O(loglog N)-time parallel algorithm for detecting all squares in a string
2. Optimal parallel algorithms for periods, palindromes and squares
3. Efficient detection of quasiperiodicities in strings
4. Optimal superprimitivity testing for strings
5. Optimal off-line detection of repetitions in a string
6. The subtree max gap problem with application to parallel string covering
7. An on-line string superprimitivity test
8. Testing string superprimitivity in parallel
9. String matching techniques for musical similarity and melodic recognition
10. An optimal algorithm for computing the repetitions in a word
11. Two-dimensional prefix string matching and covering on square matrices
12. Algorithms for computing evolutionary chains in molecular and musical sequences
13. Optimal parallel superprimitivity testing on square arrays
14. Covering a string
15. An O(nlog n) algorithm for computing all maximal quasiperiodicities in strings
16. An optimal O(log log n)-time algorithm for parallel superprimitivity testing
17. A work-time optimal algorithm for computing all string covers
18. On-line algorithms for k-covering
19. A dynamic edit distance table
20. Fast pattern matching in strings
21. Incremental string comparison
22. An algorithm for approximate tandem repeats
23. The complexity of some problems on subsequences and supersequences
24. An algorithm for finding all repetitions in a string
25. More on the complexity of common superstring and supersequence problems
26. A correction to An optimal algorithm to compute all the covers of a string
27. The shortest common supersequence problem over binary alphabet is NP-complete
28. All highest scoring paths in weighted grid graphs and its application to finding all approximate repeats in strings
29. Pattern recognition genetic sequences by mismatch density
30. On the complexity of multiple sequence alignment