scispace - formally typeset
Journal ArticleDOI

A multiple sequence alignment algorithm for homologous proteins using secondary structure information and optionally keying alignments to functionally important sites

Christina M. Henneke
- 01 Apr 1989 - 
- Vol. 5, Iss: 2, pp 141-150
Reads0
Chats0
TLDR
The programs described herein function as part of a suite of programs designed for pairwise alignment, multiple alignment, generation of randomized sequences, production of alignment scores and a sorting routine for analysis of the alignments produced.
Abstract
The programs described herein function as part of a suite of programs designed for pairwise alignment, multiple alignment, generation of randomized sequences, production of alignment scores and a sorting routine for analysis of the alignments produced. The sequence alignment programs penalize gaps (absences of residues) within regions of protein secondary structure and have the added option of 'fingerprinting' structurally or functionally important protein-residues. The multiple alignment program is based upon the sequence alignment method of Needleman and Wunsch and the multiple alignment extension of Barton and Sternberg. Our application includes the feature of optionally weighting active site, monomer--monomer, ligand contact or other important template residues to bias the alignment toward matching these residues. A sum-score for the alignments is introduced, which is independent of gap penalties. This score more adequately reflects the character of the alignments for a given scoring matrix than the gap-penalty-dependent total score described previously in the literature. In addition, individual amino acid similarity scores at each residue position in the alignments are printed with the alignment output to enable immediate quantitative assessment of homology at key sections of the aligned chains.

read more

Citations
More filters
Journal ArticleDOI

Detecting Subtle Sequence Signals: A Gibbs Sampling Strategy for Multiple Alignment

TL;DR: A mathematical definition of this "local multiple alignment" problem suitable for full computer automation has been used to develop a new and sensitive algorithm, based on the statistical method of iterative sampling, that finds an optimized local alignment model for N sequences in N-linear time, requiring only seconds on current workstations.
Journal ArticleDOI

Effects of nucleotide sequence alignment on phylogeny estimation: a case study of 18S rDNAs of apicomplexa.

TL;DR: This empirical study inferred phylogenetic trees for 43 species of the Apicomplexa and 3 of Dinozoa based on complete small-subunit rDNA sequences using six different multiple-alignment procedures, and concluded that the helical regions are the most informative.
Journal ArticleDOI

Multiple sequence alignment for phylogenetic purposes

TL;DR: The biological rather than bioinformatics aspects of molecular sequence alignment are addressed by covering a series of topics that have been under-valued, particularly within the context of phylogenetic analysis.
Journal ArticleDOI

MATCH-BOX: a fundamentally new algorithm for the simultaneous alignment of several protein sequences.

TL;DR: The algorithm provides the most likely optimal alignment and a comprehensive list of the alignment dilemma, and duality between automatism and interactivity is provided.
Journal ArticleDOI

A novel randomized iterative strategy for aligning multiple protein sequences.

M. P. Berger, +1 more
- 01 Oct 1991 - 
TL;DR: This work randomly divides a group of unaligned sequences into two subgroups, between which an optimal alignment is obtained by a Needleman-Wunsch style of algorithm, which modifies the intensive computer storage and time requirements of dynamic programming.
Related Papers (5)