Lossless filter for finding long multiple approximate repetitions using a new data structure, the Bi-factor array

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

Volumn 3772 LNCS, Issue , 2005, Pages 179-190

  Peterlongo, Pierre ^a   Pisanti, Nadia ^b,c   Boyer, Frederic ^d   Sagot, Marie France ^d,e  

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

^b UNIVERSITY OF PISA   (Italy)

^c UNIVERSITÉ PARIS 13   (France)

^d LABORATOIRE DE BIOMÉTRIE ET BIOLOGIE EVOLUTIVE   (France)

^e KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; DATA STRUCTURES; INFORMATION RETRIEVAL; PROBLEM SOLVING;

BI-FACTOR ARRAY; BIOLOGICAL SEQUENCES; FUNCTIONAL ELEMENTS;

TEXT PROCESSING;

EID: 33646751253     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11575832_20     Document Type: Conference Paper

References (21)

1. S. F. Altschul, W. Gish, W. Miller, E. W. Myers, and D. J. Lipman. A basic local alignment search tool. J. Mol. Biol., 215:403-410, 1990.
2. S. F. Altschul, T. L. Madden, A. A. Schaffer, J. Zhang, Z. Zhang, W. Miller, and D. J. Lipman. Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Res., 25:3389-3402, 1997.
3. S. Burkhardt, A. Crauser, P. Ferragina, H.-P. Lenhof, E. Rivals, and M. Vingron. q-gram based database searching using a suffix array (quasar). In proceedings of 3rd RECOMB, pages 77-83, 1999.
4. S. Burkhardt and J. Karkkainen. Better filtering with gapped q-grams. In Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, number 2089, 2001.
5. A. M. Carvalho, A. T. Freitas, A. L. Oliveira, and M-F. Sagot. A highly scalable algorithm for the extraction of cis-regulatory regions. Advances in Bioinformatics and Computational Biology, 1:273-282, 2005.
6. H. Tettelin et al. Complete genome sequence of Neisseria meningitidis serogroup B strain MC58. Science, 287(5459):1809-1815, Mar 2000.
7. M. C. Frith, U. Hansen, J. L. Spouge, and Z. Weng. Finding functional sequence elements by multiple local alignment. Nucleic Acids Res., 32, 2004.
8. C. S. Iliopoulos, J. McHugh, P. Peterlongo, N. Pisanti, W. Rytter, and M. Sagot. A first approach to finding common motifs with gaps. International Journal of Foundations of Computer Science, 2004.
9. J. Karkkainen, P. Sanders, and S. Burkhardt. Linear work suffix array construction. J. Assoc. Comput. Mach., to appear.
10. T. Kasai, G. Lee, H. Arimura, S. Arikawa, and K. Park. Linear-time longest-common-prefix computation in suffix arrays and its applications. In Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, pages 181-192. Springer-Verlag, 2001.
11. D.K. Kim, J.S. Sim, H. Park, and K. Park. Linear-time construction of suffix arrays. In Proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching, June 2003.
12. P. Ko and S. Aluru. Space efficient linear time construction of suffix arrays. Journal of Discrete Algorithms, to appear.
13. R. Kolpakov, G. Bana, and G. Kucherov. mreps: Efficient and flexible detection of tandem repeats in DNA. Nucleic Acids Res, 31(13):3672-3678, Jul 2003.
14. G. Krucherov, L.No, and M.Roytberg. Multi-seed lossless filtration. In Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching, 2004.
15. M. Li, B. Ma, D. Kisman, and J. Tromp. Patternhunter ii: Highly sensitive and fast homology search. J. of Comput. Biol., 2004.
16. D. J. Lipman and W. R. Pearson. Rapid and sensitive protein similarity searches. Sci., 227:1435-1441, 1985.
17. B. Ma, J. Tromp, and M. Li. Patternhunter: faster and more sensitive homology search. Bioinformatics, 18(3):440-445, 2002.
18. L. Marsan and M.-F. Sagot. Algorithms for extracting structured motifs using a suffix tree with application to promoter and regulatory site consensus identification. J. of Comput. Biol., (7):345-360, 2000.
19. G. Navarro, E. Sutinen, J. Tanninen, and J. Tarhio. Indexing text with approximate q-grams. In Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching, number 1848 in Lecture Notes in Computer Science, pages 350-363, 2000.
20. I. Ovcharenko, G.G. Loots, B.M. Giardine, M. Hou, J. Ma, R.C. Hardison, L. Stubbs, and W. Miller. Mulan: Multiple-sequence local alignment and visualization for studying function and evolution. Genome Research, 15:184-194, 2005.
21. K. R. Rasmussen, J. Stoye, and E. W. Myers. Efficient q-gram filters for finding all ε-matches over a given length. In Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching, 2005.