Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Stoye, J.
Right arrow Articles by Dress, A. W.M.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Stoye, J.
Right arrow Articles by Dress, A. W.M.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© Oxford University Press

DCA: An efficient implementation of the divide-and-conquer approach to simultaneous multiple sequence alignment

Jens Stoye , Vincent Moulton and Andreas W.M. Dress

Research Center for Interdisciplinary Studies on Structure Formation (FSPM), University of Bielefeld Postfach 100 131, 33501 Bielefeld, Germany

MOTIVATION:: DCA is a new computer program for multiple sequence alignment which utilizes a ‘divide-and-conquer’ type of heuristic approach.

AVAILABILITY:: The algorithm is freely available from http://bibiserv.TechFak.Uni-Bielefeld.DE/dca/

CONTACT:: E-mail: stoye{at}Mathematik.Uni-Bielefeld.DE

Received on July 7, 1997; revised on July 31, 1997; accepted on July 31, 1997

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 Brief BioinformHome page
A. Sczyrba, S. Konermann, and R. Giegerich
Two interactive Bioinformatics courses at the Bielefeld University Bioinformatics Server
Brief Bioinform, May 1, 2008; 9(3): 243 - 249.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
X. Zhang and T. Kahveci
QOMA: quasi-optimal multiple alignment of protein sequences
Bioinformatics, January 15, 2007; 23(2): 162 - 168.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
H. Luz and M. Vingron
Family specific rates of protein evolution
Bioinformatics, May 15, 2006; 22(10): 1166 - 1171.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
V. Moreau, C. Granier, S. Villard, D. Laune, and F. Molina
Discontinuous epitope prediction based on mimotope analysis
Bioinformatics, May 1, 2006; 22(9): 1088 - 1095.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
M. Sammeth, T. Griebel, F. Tille, and J. Stoye
Panta rhei (QAlign2): an open graphical environment for sequence analysis
Bioinformatics, April 1, 2006; 22(7): 889 - 890.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
S. Chakrabarti, C. J. Lanczycki, A. R. Panchenko, T. M. Przytycka, P. A. Thiessen, and S. H. Bryant
Refining multiple sequence alignments with conserved core regions.
Nucleic Acids Res., January 1, 2006; 34(9): 2598 - 2606.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
H. Zhou and Y. Zhou
SPEM: improving multiple sequence alignment with sequence profiles and predicted secondary structures
Bioinformatics, September 15, 2005; 21(18): 3615 - 3621.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
C. L. Lu and Y. P. Huang
A memory-efficient algorithm for multiple sequence alignment with constraints
Bioinformatics, January 1, 2005; 21(1): 20 - 30.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
R. D. M. Page
Comparative analysis of secondary structure of insect mitochondrial small subunit ribosomal RNA using maximum weighted matching
Nucleic Acids Res., October 15, 2000; 28(20): 3839 - 3845.
[Abstract] [Full Text] [PDF]


Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.