---
res:
bibo_abstract:
- We have developed a fast heuristic algorithm for multiple sequence alignment which
provides near-to-optimal results for sufficiently homologous sequences. The algorithm
makes use of the standard dynamic programming procedure by applying it to all
pairs of sequences. The resulting score matrices for pair-wise alignment give
rise to secondary matrices containing the additional charges imposed by forcing
the alignment path to run through a particular vertex. Such a constraint corresponds
to slicing the sequences at the positions defining that vertex, and aligning the
remaining pairs of prefix and suffix sequences separately. From these secondary
matrices, one can compute - for any given family of sequences - suitable positions
for cutting all of these sequences simultaneously, thus reducing the problem of
aligning a family of n sequences of average length l in a Divide and Conquer fashion
to aligning two families of n sequences of approximately half that length. In
this paper, we explain the method for the case of 3 sequences in detail, and we
demonstrate its potential and its limits by discussing its behaviour for several
test families. A generalization for aligning more than 3 sequences is lined out,
and some actual alignments constructed by our algorithm for various user-defined
parameters are presented.@eng
bibo_authorlist:
- autoren_ansetzung:
- Tönges, Udo
- Tönges
- Udo Tönges
- Tönges, U
- Tönges, U.
- U Tönges
- U. Tönges
foaf_Person:
foaf_givenName: Udo
foaf_name: Tönges, Udo
foaf_surname: Tönges
- autoren_ansetzung:
- Perrey, Sören W.
- Perrey
- Sören W. Perrey
- Perrey, S
- Perrey, S.
- S Perrey
- S. Perrey
- Perrey SörenW.
- Perrey, SörenW.
- Perrey Sören W.
- Perrey, Sören W.
- Perrey Sören.W.
- Perrey, Sören.W.
- Perrey Sören. W.
- Perrey, Sören. W.
foaf_Person:
foaf_givenName: Sören W.
foaf_name: Perrey, Sören W.
foaf_surname: Perrey
- autoren_ansetzung:
- Stoye, Jens
- Stoye
- Jens Stoye
- Stoye, J
- Stoye, J.
- J Stoye
- J. Stoye
foaf_Person:
foaf_givenName: Jens
foaf_name: Stoye, Jens
foaf_surname: Stoye
foaf_workInfoHomepage: http://www.librecat.org/personId=65864
orcid: 0000-0002-4656-7155
orcid_put_code_url: https://api.orcid.org/v2.0/0000-0002-4656-7155/work/35435069
- autoren_ansetzung:
- Dress, Andreas
- Dress
- Andreas Dress
- Dress, A
- Dress, A.
- A Dress
- A. Dress
foaf_Person:
foaf_givenName: Andreas
foaf_name: Dress, Andreas
foaf_surname: Dress
foaf_workInfoHomepage: http://www.librecat.org/personId=10506
bibo_doi: 10.1016/0378-1119(96)00123-0
bibo_issue: '1'
bibo_volume: '172'
dct_date: 1996^xs_gYear
dct_identifier:
- UT:A1996UE55600001
dct_isPartOf:
- http://id.crossref.org/issn/0378-1119
dct_language: eng
dct_subject:
- Secondary matrix
- Pair-wise sequence alignment
- Divide and conquer
- Multiple sequence alignment
- Dynamic programming
dct_title: A general method for fast multiple sequence alignment@
fabio_hasPubmedId: '8654965'
...