𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Approximation Algorithm for Alignment of Multiple Sequences using Motif Discovery

✍ Scribed by Laxmi Parida; Aris Floratos; Isidore Rigoutsos

Book ID
110281870
Publisher
Springer US
Year
1999
Tongue
English
Weight
850 KB
Volume
3
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Approximation algorithms for multiple se
Approximation algorithms for multiple sequence alignment
✍ Vineet Bafna; Eugene L. Lawler; Pavel A. Pevzner πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 793 KB

We consider the problem of aligning of k sequences of length n. The cost function is sum of pairs, and satisfies triangle inequality. Earlier results on finding approximation algorithms for this problem are due to Gusfield (1991) who achieved an approximation ratio of 2 -2/k, and Pevzner (1992) who

Automatic Discovery of Sub-molecular Seq
Automatic Discovery of Sub-molecular Sequence Domains in Multi-aligned Sequences: A Dynamic Programming Algorithm for Multiple Alignment Segmentation
✍ ERIC POE XING; DENISE M. WOLF; INNA DUBCHAK; SYLVIA SPENGLER; MANFRED ZORN; ILYA πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 446 KB

Automatic identi"cation of sub-structures in multi-aligned sequences is of great importance for e!ective and objective structural/functional domain annotation, phylogenetic treeing and other molecular analyses. We present a segmentation algorithm that optimally partitions a given multi-alignment int

An Improved Algorithm for Statistical Al
An Improved Algorithm for Statistical Alignment of Sequences Related by a Star Tree
✍ IstvΓ‘n MiklΓ³s πŸ“‚ Article πŸ“… 2002 πŸ› Springer 🌐 English βš– 102 KB

The insertion-deletion model developed by Thorne, Kishino and Felsenstein (1991, J. Mol. Evol., 33, 114-124; the TKF91 model) provides a statistical framework of two sequences. The statistical alignment of a set of sequences related by a star tree is a generalization of this model. The known algorit