Longest repeats with a block of k don't cares

Theoretical Computer Science

Volumn 362, Issue 1-3, 2006, Pages 248-254

  Crochemore, Maxime ^a,b   Iliopoulos, Costas S ^b   Mohamed, Manal ^b   Sagot, Marie France ^c  

^a Université de Marne la Vallée   (France)

^b KING'S COLLEGE LONDON   (United Kingdom)

^c UNIVERSITÉ LYON 1   (France)

Author keywords

Combinatorial pattern matching; Don't care; Repeat; String

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS; COMPUTER SCIENCE; PATTERN MATCHING; QUERY LANGUAGES; TREES (MATHEMATICS);

COMBINATORIAL PATTERN MATCHING; STRING; SUFFIX TREES; TIME ALGORITHMS;

BLOCK CODES;

EID: 33748743984     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.06.029     Document Type: Article

References (11)

1. M.I. Abouelhoda, S. Kurtz, E. Ohlebusch, The enhanced suffix array and its applications to genome analysis, in: Proc. Second Workshop on Algorithms in Bioinformatics, Lecture Notes in Computer Science, Vol. 2452, Springer, Berlin, 2002, pp. 449-463.
2. Abouelhoda M.I., Kurtz S., and Ohlebusch E. Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms 2 (2004) 53-86
3. Adel'son-Vel'skii G.M., and Landis Y.M. An algorithm for the organization of information. Dokl. Akad. Nauk SSSR 146 (1962) 263-266
4. Brodal G.S., Lyngsø R.B., Pedersen C.N.S., and Stoye J. Finding maximal pairs with bounded gap. J. Discrete Algorithms 1 1 (2000) 77-104 (special issue of matching patterns)
5. Brown M.R., and Tarjan R.E. A fast merging algorithm. J. ACM 27 2 (1979) 211-226
6. Franek F., Smyth W.F., and Tang Y. Computing all repeats using suffix arrays. J. Automata Languages and Combinatorics 8 4 (2003) 579-591
7. Crochemore M., and Rytter W. Jewels of Stringology (2002), World Scientific, Singapore
8. Gusfield D. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology (1997), Cambridge University Press, Cambridge
9. C.S. Iliopoulos, C. Makris, S. Sioutas, A.K. Tsakalidis, K. Tsichlas, Identifying occurrences of maximal pairs in multiple strings, in: Proc. 13th Annu. Symp. on Combinatorial Pattern Matching-CPM'02, Springer, Berlin, Vol. 2373, 2002, pp. 133-143.
10. Schieber B., and Vishkin U. On finding lowest common ancestors: simplification and parallelization. SIAM J. Comput. 17 6 (1988) 1253-1262
11. J. Stoye, Affix trees, Diploma Thesis, Technische Fakultät der Universität Bielefeld, Abteilung Informationstechnik, Report 2000-04, 2000.