Indexing gapped-factors using a tree

International Journal of Foundations of Computer Science

Volumn 19, Issue 1, 2008, Pages 71-87

  Peterlongo, Pierre ^a   Allali, Julien ^b   Sagot, Marie France ^c,d  

^a CAMPUS DE BEAULIEU   (France)

^b UNIVERSITÉ BORDEAUX 1   (France)

^c UNIVERSITÉ LYON 1   (France)

^d KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

Gapped factor; Gapped factor tree; K factor tree; String index; Suffix tree

Indexed keywords

EID: 43949131088     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054108005541     Document Type: Conference Paper

References (31)

1. D. J. Lipman and W. R. Pearson. Rapid and Sensitive Protein Similarity Searches. Science, 227:1435-1441, 1985.
2. S.F. Altschul, W. Gish, W. Miller, E.M. Myers, and D.J. Lipman. Basic Local Alignment Search Tool. Journal of Molecular Biology, 215(3):403-410, 1990.
3. 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 Research, 25:3389-3402, 1997.
4. L. Gravano, P. Ipeirotis, H. Jagadish, N. Koudas, S. Muthukrishnan, and D. Srivastava. Approximate String Joins in a Database (Almost) for Free. In In Proc. of 27th Int'l Conf. on Very Large DataBases (VLDB 2001), pages 491-500, 2001.
5. G. Navarro, E. Sutinen, J. Tanninen, and J. Tarhio. Indexing Text with Approximate q-Grams. 11th Annual Symposium on Combinatorial Pattern Matching (CPM 2000), 1848 of LNCS:350-363, 2000.
6. E. Sutinen and J. Tarhio. On Using q-Gram Locations in Approximate String Matching. Third Annual European Symposium, (ESA 95), 979 of LNCS:327-340, 1995.
7. M. Brudno, C. B. Do, G. M. Cooper, M.F. Kim, E. Davydov, E. D. Green, A. Sidow, and S. Batzoglou. LAGAN and Multi-LAGAN: Efficient Tools for Large-Scale Multiple Alignment of Genomic DNA. Genome Research, 13:721-731, 2003.
8. M. Brudno, M. Chapman, B. Göttgens, S. Batzoglou, and B. Morgenstern. Fast and Sensitive Multiple Alignment of Large Genomic Sequences. BMC Bioinformatics, 4:66, 2003.
9. R. C. Edgar. MUSCLE: Multiple Sequence Alignment with High Accuracy and High Throughput. Nucleic Acids Research, Vol. 32, No. 5:1792-1797, 2004.
10. M. Höhl, S. Kurtz, and E. Ohlebusch. Efficient Multiple Genome Alignment. ISMB (Supplement of Bioinformatics), Vol. 18:S312-S320, 2002.
11. M. Li and B. Ma. PatternHunter II: Highly Sensitive and Fast Homology Search. Genome Informatics, 14:164-175, 2003.
12. B. Ma, J. Tromp, and M. Li. Patternhunter: Faster and More Sensitive Homology Search. Bioinformatics, 18(3):440-445, 2002.
13. M. Michael, C. Dieterich, and M. Vingron. Siteblast Rapid and Sensitive Local Alignment of Genomic Sequences Employing Motif Anchors. Bioinformatics, 21(9):2093-2094, 2005.
14. S. Burkhardt, A. Crauser, P. Ferragina, H. P. Lenhof, and M. Vingron. q-Gram Based Database Searching Using a Suffix Array (QUASAR). Proceedings of the third annual international conference on Computational molecular biology (Recomb 99), pages 77-83, 1999.
15. S. Burkhardt and J. Karkkainen. Better Filtering with Gapped q-Grams. 12th Annual Symposium on Combinatorial Pattern Matching (CPM 2001), 56 of LNCS:51-70, 2001.
16. S. Burkhardt and J. Karkkainen. One-Gapped q-Gram Filters for Levenshtein Distance. 13th Annual Symposium on Combinatorial Pattern Matching (CPM 2002), 2373 of LNCS:225-234, 2002.
17. G. Kucherov, L. Noé, and M. Roytberg. Multiseed Lossless Filtration. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 02:51-61, 2005.
18. P. Peterlongo, N. Pisanti, F. Boyer, and M-F. Sagot. Lossless Filter for Finding Long Multiple Approximate Repetitions Using a New Data Structure, the Bi-factor Array. String Processing and Information Retrieval (SPIRE 2005), 3772 of LNCS:179-190, 2005.
19. P.A. Pevzner and M. Waterman. Multiple Filtration and Approximate Pattern Matching. Algorithmica, 13:135-154, 1995.
20. K. R. Rasmussen, J. Stoye, and E. W. Myers. Efficient q-Gram Filters for Finding All ε-Matches Over a Given Length. 9th Annual International Conference, Research in Computational Molecular Biology (Recomb 2005), 3678 of LNCS: 189-203, 2005.
21. J. Kärkkäinen. Computing the Threshold for q-Gram Filters. Proceedings of the 8th Scandinavian Workshop on Algorithm Theory (SWAT 2002), 2368 of LNCS:348-357, 2002.
22. C. S. Iliopoulos, J. Mchugh, P. Peterlongo, N. Pisanti, W. Rytter, and M-F. Sagot. A First Approach to Finding Common Motifs With Gaps. International Journal of Foundations of Computer Science, 16(6):1145-1154, 2005.
23. E. M. McCreight. A Space-Economical Suffix Tree Construction Algorithm. Journal of the Association of Computing Machinery, 23(2):262-272, 1976.
24. J. Allali and M.F. Sagot. The at Most k-deep Factor Tree. Technical Report #2004-03, Institut Gaspard Monge, Université de Marne-la-Vallée, 2004.
25. E. Ukkonen. On-line Construction of Suffix-Trees. Algorithmica, 14:249-260, 1995.
26. J.C. Na, A. Apostolico, C.S. Iliopoulos, and K. Park. Truncated Suffix Trees and their Application to Data Compression. Theoretical Computer Science, 304(1-3):87-101, 2003.
27. D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997.
28. J.C. Na and K. Park. Data Compression with Truncated Suffix Trees. Data Compression Conference (DCC 2000), IEEE Computer Society, online edition: http://computer.org/proceedings/dcc/0592/0592toc.htm:565, 2000.
29. L. Marsan and M-F. Sagot. Extracting Structured Motifs Using a Suffix Tree - Algorithms and Application to Promoter Consensus Identification. In RECOMB, pages 210-219, 2000.
30. N. Pisanti, A.M. Carvalho, L Marsan, and M-F. Sagot. RISOTTO: Fast Extraction of Motifs with Mismatches. Proceedings of the 7th Latin American Theoretical Informatics Symposium, 3887 of LNCS:757-768, 2006.
31. P. Thbault, S. DeGivry, T. Schiex, and C. Gaspin. Combining Constraint Processing and Pattern Matching to Describe and Locate Structured Motifs in Genomic Sequences. In Fifth IJCAI-05 Workshop on Modelling and Solving Problems with Constraints, Edindurgh, Scotland, pages 330-337, 2005.