๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

MergeAlign: improving multiple sequence alignment performance by dynamic reconstruction of consensus multiple sequence alignments

โœ Scribed by Peter W Collingridge, Steven Kelly

Book ID
119894144
Publisher
BioMed Central
Year
2012
Tongue
English
Weight
398 KB
Volume
13
Category
Article
ISSN
1471-2105

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Improving the divide-and-conquer approac
Improving the divide-and-conquer approach to sum-of-pairs multiple sequence alignment
โœ J. Stoye; S.W. Perrey; A.W.M. Dress ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 419 KB

We consider the problem of multiple sequence alignment: given k sequences of length at most n and a certain scoring function, find an alignment that minimizes the corresponding "sum of pairs" distance score. We generalize the divide-and-conquer technique described in [1,2], and present new ideas on