Anticlustal: Multiple sequence alignment by antipole clustering and linear approximate 1-median computation

Proceedings of the 2003 IEEE Bioinformatics Conference, CSB 2003

Volumn , Issue , 2003, Pages 326-336

  Di Pietro, C ^a   Di Pietro, V ^a   Emmanuele, G ^a   Ferro, A ^a   Maugeri, T ^a   Modica, E ^a   Pigola, G ^a   Pulvirenti, A ^a   Purrello, M ^a   Ragusa, M ^a   Scalia, M ^a   Shasha, D ^b   Travali, S ^a   Zimmitti, V ^a  

^a UNIVERSITY OF CATANIA   (Italy)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

Clustering; Multiple Sequence Alignment; Randomized Tournament

Indexed keywords

ALGORITHMS; BIOINFORMATICS; BIOLOGY; TREES (MATHEMATICS);

ALGORITHMIC TECHNIQUES; BIOLOGICAL APPLICATIONS; CLUSTERING; GENERAL METRIC SPACES; MULTIPLE SEQUENCE ALIGNMENT ALGORITHM; MULTIPLE SEQUENCE ALIGNMENTS; PROGRESSIVE ALIGNMENT; RANDOMIZED TOURNAMENTS;

CLUSTERING ALGORITHMS;

EID: 84960351626     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSB.2003.1227333     Document Type: Conference Paper

References (16)

1. M. Brudno, C. Do, G. Cooper, M. F. Kim, E. Davydov, NISC Sequencing Consortium, E. D. Green, A. Sidow, and S. Batzoglou. Lagan and multi-lagan: Efficient tools for large-scale multiple alignment of genomic dna. Genome Research, in press.
2. D. Cantone, G. Cincotti, A. Ferro, and A. Pulvirenti. An efficient algorithm for the 1-median problem. Technical Report University of Catania, Submitted, 2003.
3. D. Cantone, A. Ferro, A. Pulvirenti, D. Reforgiato, and D. Shasha. Antipole indexing to support range search and k-nearest neighbor metric spaces. Technical Report University of Catania, Submitted, 2003.
4. H. Carrillo and D. Lipmann. The multiple sequence alignment problem in biology. SIAM Journal on Applied Mathematics, 48:1073-1082, 1988.
5. E. Chavez, G. Navarro, R. Baeza-Yates, and J.L. Marroquin. Searching in metric spaces. ACM Computing Surveis, 33(3):273-321, 2001.
6. M. Crochemore, G.M. Landau, and M. Ziv-Ukelson. A sub-quadratic sequence alignment algorithm for unrestricted scoring matrices. Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 679-688, 2002.
7. D. Feng and R. F. Doolitle. Progressive sequence alignment as a prerequisite to correct phylogenetic trees. Journal of Molecular Evolution, 60:351-360, 1987.
8. W.M. Fitch and E. Margoliash. Construction of phylogenetic trees. Science, 155:279-284, 1967.
9. M. Gribskov, R. Luethy, and D.Eisenberg. Profile analysis. Methods in Enzymology, 183:146-159, 1989.
10. D. Gusfield. Algorithms on Strings, Trees and Sequences. Cambridge University Press, New York, 1997.
11. D.G. Higgins, J.T. Thompson, and T.J. Gibson. Clustal w: improving the sensivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalities and weight matrix choice. Nucleic Acid Research, 22:4673-4680, 1994.
12. D.G. Higgins, J.T. Thompson, and T.J. Gibson. Using clustal for multiple sequence alignments. Methods in Enzymology, 266:383-402, 1996.
13. B. Morgenstern, K. Frech, A. Dress, and T. Werner. Dialign: Finding local similarities by multiple sequence alignment. Bioinformatics, 14:290-294, 1998.
14. E.W. Myers and W. Miller. Optimal alignments in linear space. CABIOS, 4(1):11-17, 1988.
15. M. Purrello, C. Di Pietro, M. Ragusa, A. Pulvirenti, G. Pigola, V. Zimmitti, V. Di Pietro, T. Maugeri, G. Emmanuele, E. Modica, S. Travali, M. Scalia,, D. Shasha, and A. Ferro. In vitro and in silico cloning of xenopus laevis sod2 demonstrates very high aminoacid sequence conservation during evolution. Submitted, 2003.
16. H. Saitou and M. Hei. The neighbor-joining method: A new method for reconstructing phylogenetic trees. Mol. Biol. Evol., 4:406-425, 1987.