The gapped-factor tree

Proceedings of the Prague Stringology Conference '06

Volumn , Issue , 2006, Pages 182-192

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

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

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

^c KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

Gapped factor; Gapped factor tree; k factor factor tree; String index; Suffix tree

Indexed keywords

GAPPED-FACTOR; GAPPED-FACTOR TREE; K-FACTOR; STRING INDEX; SUFFIX-TREES;

DATA STRUCTURES; PATTERN MATCHING;

FORESTRY;

EID: 84864158767     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. J. Allali and M. Sagot: The at most k-deep factor tree, Tech. Rep. #2004-03, InstitutGaspard Monge, Universit́e de Marne-la-Valĺee, 2004.
2. S. Altschul, W. Gish, W. Miller, E. Myers, and D. Lipman: Basic local alignment search tool. Journal of Molecular Biology, 215(3) 1990, pp. 403-410.
3. S. Altschul, T. Madden, A. Schaffer, J. Zhang, Z. Zhang, W. Miller, and D. Lip- man: Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Research, 25 1997, pp. 3389-3402.
4. M. Brudno, M. Chapman, B. Göttgens, S. Batzoglou, and B. Morgenstern: Fast and sensitive multiple alignment of large genomic sequences. BMC Bioinformatics, 4 2003, p. 66.
5. M. Brudno, C. B. Do, G. M. Cooper, M. 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 2003, pp. 721-731.
6. 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), 1999, pp. 77-83.
7. S. Burkhardt and J. K̈arkk̈ainen: Better filtering with gapped q-grams, in Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching (CPM 2001), vol. 2089 of LNCS, 2001, pp. 73-85.
8. S. Burkhardt and J. Kärkkäinen: One-gapped q-gram filters for Levenshtein distance. 13th Annual Symposium on Combinatorial Pattern Matching (CPM 2002), 2373 of LNCS 2002, pp. 225-234.
9. R. C. Edgar: MUSCLE: Multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Research, 32(5) 2004, pp. 1792-1797.
10. L. Gravano, P. Ipeirotis, H. Jagadish, N. Koudas, S. Muthukrishnan, and D. Sri-vastava: Approximate string joins in a database (almost) for free, in In Proc. of 27th Int'l Conf. on Very Large DataBases (VLDB 2001), 2001, pp. 491-500.
11. D. Gusfield: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, Cambridge University Press, 1997.
12. M. Höhl, S. Kurtz, and E. Ohlebusch: Efficient multiple genome alignment. ISMB (Supplement of Bioinformatics), Vol. 18 2002, pp. S312-S320.
13. 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) 2005, pp. 1145-1154.
14. 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 2002, pp. 348-357.
15. G. Kucherov, L. Noe, and M. Roytberg: Multiseed lossless filtration. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 02 2005, pp. 51-61.
16. M. Li and B. Ma: Pattern Hunter II: Highly sensitive and fast homology search. Genome Informatics, 14 2003, pp. 164-175.
17. D. J. Lipman and W. R. Pearson: Rapid and sensitive protein similarity searches. Science, 227 1985, pp. 1435-1441.
18. B. Ma, J. Tromp, and M. Li: PatternHunter: Faster and more sensitive homology search. Bioinformatics, 18(3) 2002, pp. 440-445.
19. L. Marsan and M.-F. Sagot: Extracting structured motifs using a suffix tree - algorithms and application to promoter consensus identification, in RECOMB, 2000, pp. 210-219.
20. E. M. McCreight: A space-economical suffix tree construction algorithm. Journal of the Association of Computing Machinery, 23(2) 1976, pp. 262-272.
21. M. Michael, C. Dieterich, and M. Vingron: Siteblast rapid and sensitive local alignment of genomic sequences employing motif anchors. Bioinformatics, 21(9) 2005, pp. 2093-2094.
22. J. Na, A. Apostolico, C. Iliopoulos, and K. Park: Truncated suffix trees and their application to data compression. Theor. Comput. Sci., 304(1-3) 2003, pp. 87-101.
23. J. 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 2000, p. 565.
24. 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 2000, pp. 350-363.
25. 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 2005, pp. 179-190.
26. P. Pevzner and M. Waterman: Multiple filtration and approximate pattern matching. Algorithmica, 13 1995, pp. 135-154.
27. N. Pisanti, A. Carvalho, L. Marsan, and M.-F. Sagot: RISOTTO: Fast extraction of motifs with mismatches, in Proceedings of the 7th Latin American Theoretical Informatics Symposium, vol. 3887 of LNCS, 2006, pp. 757-768.
28. K. R. Rasmussen, J. Stoye, and E. W. Myers: Efficient q-gram filters for finding all ε-matches over a given length, in 9th Annual International Conference, Research in Computational Molecular Biology (Recomb 2005), vol. 3678 of LNCS, 2005, pp. 189-203.
29. E. Sutinen and J. Tarhio: On using q-gram locations in approximate string matching, in Third Annual European Symposium, (ESA 95), vol. 979 of LNCS, 1995, pp. 327-340.
30. P. Thébault, 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, 2005, pp. 330-337.
31. E. Ukkonen: On-line construction of suffix-trees. Algorithmica, 14 1995, pp. 249-260.