Iterative versus simultaneous multiple sequence alignment

Dress A (1997)
In: Combinatorial Pattern Matching. 8th Annual Symposium, CPM 97 Aarhus, Denmark, June 30–July 2, 1997 Proceedings. Apostolico A, Hein J (Eds); Lecture Notes in Computer Science, 1264. Berlin: Springer: 275-275.

Konferenzbeitrag | Veröffentlicht | Englisch
 
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Herausgeber*in
Apostolico, Alberto ; Hein, Jotun
Abstract / Bemerkung
Due to unsurmountable time requirements, straight-forward dynamical-programming approaches to multiple sequence alignment were abandoned a long time ago in favour of iterative procedures. Some of those have been elaborated to great perfection, using many years of experience regarding the optimal adjustment of biologically relevant aligment parameters. The situation changed somewhat with the availability of “MSA”-a program which is based on some clever “branch bound” procedures to reduce, by several orders of magnitude, the enormous search space one has to cope with. This way, MSA is able to compute optimal multiple sequence aligments with regard to appropriately defined “sum of pairs scores” for, say, up to six protein sequences of modest length (up to, say, 300 amino acids) and sufficiently high sequence homology. Still, many biologically important sequence families turned out to be by far too complex to be aligned simultaneously by MSA. Here, the new DIVIDE &: CONQUER multiple sequence alignment algorithm “DCA” can now be invoked to find (almost) optimal simultaneous alignments in situations where formerly the construction of such alignments was out of question. In the lecture, the workings of DCA will be explained shortly, some applications to biologically relevant data sets will be discussed and the potential of this new approach regarding some basic problems in sequence alignment will be evaluated. © Springer-Verlag Berlin Heidelberg 1997
Erscheinungsjahr
1997
Titel des Konferenzbandes
Combinatorial Pattern Matching. 8th Annual Symposium, CPM 97 Aarhus, Denmark, June 30–July 2, 1997 Proceedings
Band
1264
Seite(n)
275-275
Konferenz
Combinatorial Pattern Matching. 8th Annual Symposium, CPM 97
Konferenzort
Aarhus, Denmark
Konferenzdatum
1997-06-30 – 1997-07-02
ISSN
0302-9743
Page URI
https://pub.uni-bielefeld.de/record/1616509

Zitieren

Dress A. Iterative versus simultaneous multiple sequence alignment. In: Apostolico A, Hein J, eds. Combinatorial Pattern Matching. 8th Annual Symposium, CPM 97 Aarhus, Denmark, June 30–July 2, 1997 Proceedings. Lecture Notes in Computer Science. Vol 1264. Berlin: Springer; 1997: 275-275.
Dress, A. (1997). Iterative versus simultaneous multiple sequence alignment. In A. Apostolico & J. Hein (Eds.), Lecture Notes in Computer Science: Vol. 1264. Combinatorial Pattern Matching. 8th Annual Symposium, CPM 97 Aarhus, Denmark, June 30–July 2, 1997 Proceedings (pp. 275-275). Berlin: Springer. https://doi.org/10.1007/3-540-63220-4_65
Dress, A. (1997). “Iterative versus simultaneous multiple sequence alignment” in Combinatorial Pattern Matching. 8th Annual Symposium, CPM 97 Aarhus, Denmark, June 30–July 2, 1997 Proceedings, Apostolico, A., and Hein, J. eds. Lecture Notes in Computer Science, vol. 1264, (Berlin: Springer), 275-275.
Dress, A., 1997. Iterative versus simultaneous multiple sequence alignment. In A. Apostolico & J. Hein, eds. Combinatorial Pattern Matching. 8th Annual Symposium, CPM 97 Aarhus, Denmark, June 30–July 2, 1997 Proceedings. Lecture Notes in Computer Science. no.1264 Berlin: Springer, pp. 275-275.
A. Dress, “Iterative versus simultaneous multiple sequence alignment”, Combinatorial Pattern Matching. 8th Annual Symposium, CPM 97 Aarhus, Denmark, June 30–July 2, 1997 Proceedings, A. Apostolico and J. Hein, eds., Lecture Notes in Computer Science, vol. 1264, Berlin: Springer, 1997, pp.275-275.
Dress, A.: Iterative versus simultaneous multiple sequence alignment. In: Apostolico, A. and Hein, J. (eds.) Combinatorial Pattern Matching. 8th Annual Symposium, CPM 97 Aarhus, Denmark, June 30–July 2, 1997 Proceedings. Lecture Notes in Computer Science. 1264, p. 275-275. Springer, Berlin (1997).
Dress, Andreas. “Iterative versus simultaneous multiple sequence alignment”. Combinatorial Pattern Matching. 8th Annual Symposium, CPM 97 Aarhus, Denmark, June 30–July 2, 1997 Proceedings. Ed. Alberto Apostolico and Jotun Hein. Berlin: Springer, 1997.Vol. 1264. Lecture Notes in Computer Science. 275-275.

Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Web of Science

Dieser Datensatz im Web of Science®

Suchen in

Google Scholar