Abstract

Abstract MOTIVATION: The performance and time complexity of an improved version of the segment-to-segment approach to multiple sequence alignment is discussed. In this approach, alignments are composed from gap-free segment pairs, and the score of an alignment is defined as the sum of so-called weights of these segment pairs. RESULTS: A modification of the weight function used in the original version of the alignment program DIALIGN has two important advantages: it can be applied to both globally and locally related sequence sets, and the running time of the program is considerably improved. The time complexity of the algorithm is discussed theoretically, and the program running time is reported for various test examples. AVAILABILITY: The program is available on-line at the Bielefeld University Bioinformatics Server (BiBiServ) http://bibiserv.TechFak.Uni-Bielefeld.DE/dial ign/

Keywords

Computer scienceSequence (biology)Multiple sequence alignmentFunction (biology)AlgorithmLine (geometry)Sequence alignmentMathematics

Affiliated Institutions

Related Publications

Publication Info

Year
1999
Type
article
Volume
15
Issue
3
Pages
211-218
Citations
686
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

686
OpenAlex

Cite This

Burkhard Morgenstern (1999). DIALIGN 2: improvement of the segment-to-segment approach to multiple sequence alignment.. Bioinformatics , 15 (3) , 211-218. https://doi.org/10.1093/bioinformatics/15.3.211

Identifiers

DOI
10.1093/bioinformatics/15.3.211