Treffer: DIALIGN 2 : improvement of the segment-to-segment approach to multiple sequence alignment

Title:
DIALIGN 2 : improvement of the segment-to-segment approach to multiple sequence alignment
Authors:
Source:
Selection of papers presented at the German Conference on Bioinformatics (GCB'98, Cologne, Germany, October 1998Bioinformatics (Oxford. Print). 15(3):211-218
Publisher Information:
Oxford: Oxford University Press, 1999.
Publication Year:
1999
Physical Description:
print, 34 ref
Original Material:
INIST-CNRS
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
GSF - National Research Center for Environment and Health, Institute of Biomathematics and Biometry, Ingolstädter Landstrasse 1, 85764 Neuherberg, Germany
ISSN:
1367-4803
Rights:
Copyright 1999 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Biological sciences. Generalities. Modelling. Methods

Generalities in biological sciences
Accession Number:
edscal.1832317
Database:
PASCAL Archive

Weitere Informationen

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.