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

A novel method of multiple alignment of biopolymer sequences

โœ Scribed by L.I. Brodsky; A.L. Drachev; A.M. Leontovich; S.I. Feranchuk


Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
983 KB
Volume
30
Category
Article
ISSN
0303-2647

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Fast multiple alignment of ungapped DNA
โœ Thomas D. Schneider; David N. Mastronarde ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 651 KB

An information theory based multiple alignment ("Malign") method was used to align the DNA binding sequences of the OxyR and Fis proteins, whose sequence conservation is so spread out that it is difficult to identify the sites. In the algorithm described here, the information content of the sequence

Non-approximability of weighted multiple
โœ Bodo Manthey ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 167 KB

We consider a weighted generalization of multiple sequence alignment (MSA) with sum-of-pair score. MSA without weights is known to be NP-complete and can be approximated within a constant factor, but it is unknown whether it has a polynomial time approximation scheme. Weighted multiple sequence alig

Automatic Discovery of Sub-molecular Seq
โœ 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