Faster algorithms for computing maximal multirepeats in multiple sequences

Fundamenta Informaticae

Volumn 97, Issue 3, 2009, Pages 311-320

  Iliopoulos, Costas S ^a,b   Smyth, W F ^b,c   Yusufu, Munina ^b,c  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b CURTIN UNIVERSITY   (Australia)

^c MCMASTER UNIVERSITY   (Canada)

Author keywords

Biological sequences; Gaps; Maximal multirepeats; Repeats; Suffix arrays

Indexed keywords

BIOLOGICAL SEQUENCES; EFFICIENT ALGORITHM; MAXIMAL REPEATS; MULTIPLE SEQUENCES; SUBSTRING; SUFFIX ARRAYS;

ALGORITHMS; INDEXING (OF INFORMATION);

COMPUTATION THEORY;

EID: 77149177978     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/FI-2009-203     Document Type: Article

References (12)

1. A. Bakalis, Costas S. Iliopoulos, Christos Makris, Spyros Sioutas, Evangelos Theodoridis, Athanasios K. Tsakalidis, Kostas Tsichlas: Locating maximal multirepeats in multiple strings under various constraints, The Computer Journal 50-2, 2007, 178-185.
2. Michael Burrows, David J. Wheeler: A Block-Sorting Lossless Data Compression Algorithm, Technical Report 124, Digital Equipment Corporation, 1994.
3. Johannes Fischer, Volker Heun, Stefan Kramer: Optimal string mining under frequency constraints, Proc. 10th European Conf. on Principles and Practice of Knowledge Discovery in Databases, LNCS 4213, Springer-Verlag, 2006, 139-150.
4. Dan Gusfield: Algorithms on Strings, Trees and Sequences, Cambridge University Press, 1997.
5. Juha Kärkkäinen, Peter Sanders: Simple linear work suffix array construction, Proc. 30th Internat. Colloq. Automata, Languages & Programming, LNCS 2971, Springer-Verlag, 2003, 943-955.
6. Toru Kasai, Gunho Lee, Hiroki Arimura, Setsuo Arikawa, Kunsoo Park: Linear-time longest-common-prefix computation in suffix arrays and its applications, Proc. 12th Annual Symp. Combinatorial Pattern Matching, LNCS 2089, Springer-Verlag, 2001, 181-192.
7. Pang Ko, Srinivas Aluru: Space efficient linear time construction of suffix arrays, Proc. 14th Annual Symp. Combinatorial Pattern Matching, R. Baeza-Yates, E. Ch́avez&M. Crochemore (eds.), LNCS 2676, Springer- Verlag, 2003, 200-210.
8. Sau Dan Lee, Luc De Raedt: An efficient algorithm for mining string databases under constraints, Proc. KDID, LNCS 3377, Springer-Verlag, 2005, 108-129.
9. Giovanni Manzini: Two space saving tricks for linear time LCP computation, Proc. 9th Scandinavian Workshop on Algorithm Theory, LNCS 3111, Springer-Verlag, 2004, 372-383.
10. Simon J. Puglisi, W. F. Smyth, Munina Yusufu: Fast optimal algorithms for computing all the repeats in a string, Prague Stringology Conference, Jan Holub & Jan ? Zd'́arek (eds.), 2008, 161-169.
11. Simon J. Puglisi, W. F. Smyth, Andrew Turpin: A taxonomy of suffix array construction algorithms, ACM Computing Surveys 39-42, Article 4, 2007.
12. Bill Smyth: Computing Patterns in Strings, Pearson Addison-Wesley, 2003.