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

DIALIGN-T: An improved algorithm for segment-based multiple sequence alignment

โœ Scribed by Amarendran R Subramanian; Jan Weyer-Menkhoff; Michael Kaufmann; Burkhard Morgenstern

Book ID
115000096
Publisher
BioMed Central
Year
2005
Tongue
English
Weight
367 KB
Volume
6
Category
Article
ISSN
1471-2105

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Segment-based multiple sequence alignmen
Segment-based multiple sequence alignment
โœ Rausch, T.; Emde, A.-K.; Weese, D.; Doring, A.; Notredame, C.; Reinert, K. ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Oxford University Press ๐ŸŒ English โš– 200 KB
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