Divide-and-conquer multiple alignment with segment-based constraints

Sammeth M, Morgenstern B, Stoye J (2003)
BIOINFORMATICS 19(Suppl 2): ii189-ii195.

Download
OA
DOI
URN
urn:nbn:de:0070-pub-16094031
Journal Article | Original Article | Published | English
View fulltext
Author
; ;
Department
Technische Fakultät > AG Genominformatik
Centrum für Biotechnologie > Research Group J. Stoye
Centrum für Biotechnologie > Institut für Bioinformatik
Abstract
A large number of methods for multiple sequence alignment are currenty available. Recent benchmarking tests demonstrated that strengths and drawbacks of these methods differ substantially. Global strategies can be outperformed by approaches based on local similarities and vice versa, depending on the characteristics of the input sequences. In recent years, mixed approaches that include both global and local features have shown promising results. Herein, we introduce a new algorithm for multiple sequence alignment that integrates the global divide-and-conquer approach with the local segment-based approach, thereby combining the strengths of those two strategies.
Publishing Year
2003
ISSN
1367-4803
eISSN
1460-2059
PUB-ID

Cite this

Sammeth M, Morgenstern B, Stoye J. Divide-and-conquer multiple alignment with segment-based constraints. BIOINFORMATICS. 2003;19(Suppl 2):ii189-ii195.
Sammeth, M., Morgenstern, B., & Stoye, J. (2003). Divide-and-conquer multiple alignment with segment-based constraints. BIOINFORMATICS, 19(Suppl 2), ii189-ii195. doi:10.1093/bioinformatics/btg1077
Sammeth, M., Morgenstern, B., and Stoye, J. (2003). Divide-and-conquer multiple alignment with segment-based constraints. BIOINFORMATICS 19, ii189-ii195.
Sammeth, M., Morgenstern, B., & Stoye, J., 2003. Divide-and-conquer multiple alignment with segment-based constraints. BIOINFORMATICS, 19(Suppl 2), p ii189-ii195.
M. Sammeth, B. Morgenstern, and J. Stoye, “Divide-and-conquer multiple alignment with segment-based constraints”, BIOINFORMATICS, vol. 19, 2003, pp. ii189-ii195.
Sammeth, M., Morgenstern, B., Stoye, J.: Divide-and-conquer multiple alignment with segment-based constraints. BIOINFORMATICS. 19, ii189-ii195 (2003).
Sammeth, Michael, Morgenstern, Burkhard, and Stoye, Jens. “Divide-and-conquer multiple alignment with segment-based constraints”. BIOINFORMATICS 19.Suppl 2 (2003): ii189-ii195.
All files available under the following license(s):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]
Main File(s)
File Name
ii189.pdf
Access Level
OA Open Access

This data publication is cited in the following publications:
This publication cites the following data publications:

6 Citations in Europe PMC

Data provided by Europe PubMed Central.

RE-MuSiC: a tool for multiple sequence alignment with regular expression constraints.
Chung YS, Lee WH, Tang CY, Lu CL., Nucleic Acids Res 35(web server issue), 2007
PMID: 17488842
Global multiple-sequence alignment with repeats.
Sammeth M, Heringa J., Proteins 64(1), 2006
PMID: 16609972
A memory-efficient algorithm for multiple sequence alignment with constraints.
Lu CL, Huang YP., Bioinformatics 21(1), 2005
PMID: 15374876
Multiple sequence alignment with user-defined constraints at GOBICS.
Morgenstern B, Werner N, Prohaska SJ, Steinkamp R, Schneider I, Subramanian AR, Stadler PF, Weyer-Menkhoff J., Bioinformatics 21(7), 2005
PMID: 15546937
DIALIGN: multiple DNA and protein sequence alignment at BiBiServ.
Morgenstern B., Nucleic Acids Res 32(web server issue), 2004
PMID: 15215344
A novel method for multiple alignment of sequences with repeated and shuffled elements.
Raphael B, Zhi D, Tang H, Pevzner P., Genome Res 14(11), 2004
PMID: 15520295

Export

0 Marked Publications

Open Data PUB

Web of Science

View record in Web of Science®

Sources

PMID: 14534189
PubMed | Europe PMC

Search this title in

Google Scholar