PubMed Health⌕ Search

SEARCH · PubMed Health

Results for “Multiple Sequence Alignment”

Explore indexed PubMed citations for clinical trials, systematic reviews and public health research. Read source abstracts and follow each citation to its original PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 271 records · Page 15Linked to original sources
PubMed2000

Selection of conserved blocks from multiple alignments for their use in phylogenetic analysis.

The use of some multiple-sequence alignments in phylogenetic analysis, particularly those that are not very well conserved, requires the elimination of poorly aligned positions and divergent regions, since they may not be homologous or may have been saturated by multiple substitutions. A computerized method that eliminates such positions and at the same time tries to minimize the loss of informative sites is presented here. The method is based on the selection of blocks of positions that fulfill a simple set of requirements with respect to the number of contiguous conserved positions, lack of gaps, and high conservation of flanking positions, making the final alignment more suitable for phylogenetic analysis. To illustrate the efficiency of this method, alignments of 10 mitochondrial proteins from several completely sequenced mitochondrial genomes belonging to diverse eukaryotes were used as examples. The percentages of removed positions were higher in the most divergent alignments. After removing divergent segments, the amino acid composition of the different sequences was more uniform, and pairwise distances became much smaller. Phylogenetic trees show that topologies can be different after removing conserved blocks, particularly when there are several poorly resolved nodes. Strong support was found for the grouping of animals and fungi but not for the position of more basal eukaryotes. The use of a computerized method such as the one presented here reduces to a certain extent the necessity of manually editing multiple alignments, makes the automation of phylogenetic analysis of large data sets feasible, and facilitates the reproduction of the final alignment by other researchers.

Amino Acid Sequence↗
PubMed2001

AL2CO: calculation of positional conservation in a protein sequence alignment.

MOTIVATION: Amino acid sequence alignments are widely used in the analysis of protein structure, function and evolutionary relationships. Proteins within a superfamily usually share the same fold and possess related functions. These structural and functional constraints are reflected in the alignment conservation patterns. Positions of functional and/or structural importance tend to be more conserved. Conserved positions are usually clustered in distinct motifs surrounded by sequence segments of low conservation. Poorly conserved regions might also arise from the imperfections in multiple alignment algorithms and thus indicate possible alignment errors. Quantification of conservation by attributing a conservation index to each aligned position makes motif detection more convenient. Mapping these conservation indices onto a protein spatial structure helps to visualize spatial conservation features of the molecule and to predict functionally and/or structurally important sites. Analysis of conservation indices could be a useful tool in detection of potentially misaligned regions and will aid in improvement of multiple alignments. RESULTS: We developed a program to calculate a conservation index at each position in a multiple sequence alignment using several methods. Namely, amino acid frequencies at each position are estimated and the conservation index is calculated from these frequencies. We utilize both unweighted frequencies and frequencies weighted using two different strategies. Three conceptually different approaches (entropy-based, variance-based and matrix score-based) are implemented in the algorithm to define the conservation index. Calculating conservation indices for 35522 positions in 284 alignments from SMART database we demonstrate that different methods result in highly correlated (correlation coefficient more than 0.85) conservation indices. Conservation indices show statistically significant correlation between sequentially adjacent positions i and i + j, where j < 13, and averaging of the indices over the window of three positions is optimal for motif detection. Positions with gaps display substantially lower conservation properties. We compare conservation properties of the SMART alignments or FSSP structural alignments to those of the ClustalW alignments. The results suggest that conservation indices should be a valuable tool of alignment quality assessment and might be used as an objective function for refinement of multiple alignments. AVAILABILITY: The C code of the AL2CO program and its pre-compiled versions for several platforms as well as the details of the analysis are freely available at ftp://iole.swmed.edu/pub/al2co/.

Algorithms↗
PubMed2002

Quality assessment of multiple alignment programs.

A renewed interest in the multiple sequence alignment problem has given rise to several new algorithms. In contrast to traditional progressive methods, computationally expensive score optimization strategies are now predominantly employed. We systematically tested four methods (Poa, Dialign, T-Coffee and ClustalW) for the speed and quality of their alignments. As test sequences we used structurally derived alignments from BAliBASE and synthetic alignments generated by Rose. The tests included alignments of variable numbers of domains embedded in random spacer sequences. Overall, Dialign was the most accurate in cases with low sequence identity, while T-Coffee won in cases with high sequence identity. The fast Poa algorithm was almost as accurate, while ClustalW could compete only in strictly global cases with high sequence similarity.

Evolution, Molecular↗
PubMed1992

Pattern-induced multi-sequence alignment (PIMA) algorithm employing secondary structure-dependent gap penalties for use in comparative protein modelling.

A multiple sequence alignment algorithm is described that uses a dynamic programming-based pattern construction method to align a set of homologous sequences based on their common pattern of conserved sequence elements. This pattern-induced multi-sequence alignment (PIMA) algorithm can employ secondary-structure dependent gap penalties for use in comparative modelling of new sequences when the three-dimensional structure of one or more members of the same family is known. We show that the use of secondary structure information can significantly improve the accuracy of aligning structure boundaries in a set of homologous sequences even when the structure of only one member of the family is known.

Algorithms↗
PubMed1993

Alignment-ambiguous nucleotide sites and the exclusion of systematic data.

Molecular systematists generally rely on computer algorithms to establish the alignment of DNA sequences. However, when alignment regions are characterized by multiple insertions and deletions, these gap-filled stretches of DNA are often excised before phylogenetic reconstruction. This exclusion of systematic data is generally determined by subjective criteria. We explore a replicable methodology in which the comparison of several multiple sequence alignments can be used to eliminate regions of unstable sequence alignment. Using crocodilian and insect mitochondrial (mt) ribosomal (r) DNA as examples, we caution against the removal of sequence data prior to phylogenetic reconstruction.

Algorithms↗
PubMed1991

A new method for building protein conformations from sequence alignments with homologues of known structure.

We describe a largely automatic procedure for building protein structures from sequence alignments with homologues of known structure. This procedure uses simple rules by which multiple sequence alignments can be translated into distance and chirality constraints, which are then used as input for distance geometry calculations. By this means one obtains an ensemble of conformations for the unknown structure that are compatible with the rules employed, and the differences among these conformations provide an indication of the reliability of the structure prediction. The overall approach is demonstrated here by applying it to several Kazal-type trypsin inhibitors, for which experimentally determined structures are available. On the basis of our experience with these test problems, we have further predicted the conformation of the human pancreatic secretory trypsin inhibitor, for which no experimentally determined structure is presently available.

Algorithms↗
PubMedDate not supplied

A Bayesian model for detecting past recombination events in DNA multiple alignments.

Most phylogenetic tree estimation methods assume that there is a single set of hierarchical relationships among sequences in a data set for all sites along an alignment. Mosaic sequences produced by past recombination events will violate this assumption and may lead to misleading results from a phylogenetic analysis due to the imposition of a single tree along the entire alignment. Therefore, the detection of past recombination is an important first step in an analysis. A Bayesian model for the changes in topology caused by recombination events is described here. This model relaxes the assumption of one topology for all sites in an alignment and uses the theory of Hidden Markov models to facilitate calculations, the hidden states being the underlying topologies at each site in the data set. Changes in topology along the multiple sequence alignment are estimated by means of the maximum a posteriori (MAP) estimate. The performance of the MAP estimate is assessed by application of the model to data sets of four sequences, both simulated and real.

Bayes Theorem↗
PubMed1995

ALIGNMENT SERVICE: creation and processing of alignments of sequences of unlimited length.

A package for the creation and processing of multiple sequence alignment is described. There is no limit on the lengths of the processed nucleotide or amino acid sequences, and the number of sequences in the alignment is also unlimited. The main groups of functions are: a semiautomatic alignment editor; a wide set of functions for technical processing of alignments; nucleotide alignment mapping and translation; and similarity search functions. A user-friendly interface and a set of generally used file actions provide a special operational subsystem for everyday tasks.

Amino Acid Sequence↗
PubMed1995

Sequence of the canine herpesvirus thymidine kinase gene: taxon-preferred amino acid residues in the alphaherpesviral thymidine kinases.

Multiple sequence alignments of evolutionarily related proteins are finding increasing use as indicators of critical amino acid residues necessary for structural stability or involved in functional domains responsible for catalytic activities. In the past, a number of alignments have provided such information for the herpesviral thymidine kinases, for which three-dimensional structures are not yet available. We have sequenced the thymidine kinase gene of a canine herpesvirus, and with a multiple alignment have identified amino acids preferentially conserved in either of two taxons, the genera Varicellovirus and Simplexvirus, of the subfamily Alphaherpesvirinae. Since some regions of the thymidine kinases show otherwise elevated levels of substitutional tolerance, these conserved amino acids are candidates for critical residues which have become fixed through selection during the evolutionary divergence of these enzymes. Several pairs with distinctive patterns of distribution among the various viruses occur in or near highly conserved sequence motifs previously proposed to form the catalytic site, and we speculate that they may represent interacting, co-ordinately variable residues.

Alphaherpesvirinae↗
PubMed1998

CINEMA--a novel colour INteractive editor for multiple alignments.

CINEMA is a new editor for manipulating and generating multiple sequence alignments. The program provides both an interface to existing databases of alignments on the Internet and a tool for constructing and modifying alignments locally. It is written in Java, so executable code will run on most major desktop platforms without modification. The implementation is highly flexible, so the applet can be easily customised with additional functions; and the object classes are reusable, promoting rapid development of program extensions. Formerly, such extended functionality might have been provided via browser plug-ins, which have to be downloaded and installed on every client before loading data. Now, for the first time, an applet is available that allows interactive client-side processing of an alignment, which can then be stored or processed automatically on the server. The program is embedded in a comprehensive help file and is accessible both as a stand-alone tool on UCL's Bioinformatics Server; http:/(/)www.biochem.ucl.ac.uk/bsm/dbbrowser+ ++/CINEMA2.02/, and as an integral part of the PRINTS protein fingerprint database. Exploitation of such novel technologies revolutionises the way users may interact with public databases in the future: bioinformatics centres need not simply provide data, but are now able to offer the means by which information is visualised and manipulated, without the requirement for users to install software.

Color Perception↗
PubMed2000

An assessment of the phylogenetic relationship among sugarcane and related taxa based on the nucleotide sequence of 5S rRNA intergenic spacers.

5S rRNA intergenic spacers were amplified from two elite sugarcane (Saccharum hybrids) cultivars and their related taxa by polymerase chain reaction (PCR) with 5S rDNA consensus primers. Resulting PCR products were uniform in length from each accession but exhibited some degree of length variation among the sugarcane accessions and related taxa. These PCR products did not always cross hybridize in Southern blot hybridization experiments. These PCR products were cloned into a commercial plasmid vector PCR 2.1 and sequenced. Direct sequencing of cloned PCR products revealed spacer length of 231-237 bp for S. officinarum, 233-237 for sugarcane cultivars, 228-238 bp for S. spontaneum, 239-252 bp for S. giganteum, 385-410 bp for Erianthus spp., 226-230 bp for Miscanthus sinensis Zebra, 206-207 bp for M. sinensis IMP 3057, 207-209 bp for Sorghum bicolor, and 247-249 bp for Zea mays. Nucleotide sequence polymorphism were found at both the segment and single nucleotide level. A consensus sequence for each taxon was obtained by Align X. Multiple sequences were aligned and phylogenetic trees constructed using Align X. CLUSTAL and DNAMAN programs. In general, accessions of the following taxa tended to group together to form distinct clusters: S. giganteum, Erianthus spp., M. sinensis, S. bicolor, and Z. mays. However, the two S. officinarum clones and two sugarcane cultivars did not form distinct clusters but interrelated within the S. spontaneum cluster. The disclosure of these 5S rRNA intergenic spacer sequences will facilitate marker-assisted breeding in sugarcane.

Base Sequence↗
PubMed2003

Protein family annotation in a multiple alignment viewer.

SUMMARY: The Pfaat protein family alignment annotation tool is a Java-based multiple sequence alignment editor and viewer designed for protein family analysis. The application merges display features such as dendrograms, secondary and tertiary protein structure with SRS retrieval, subgroup comparison, and extensive user-annotation capabilities. AVAILABILITY: The program and source code are freely available from the authors under the GNU General Public License at http://www.pfizerdtc.com

Amino Acid Sequence↗
PubMed2003

Simultaneous sequence alignment and tree construction using hidden Markov models.

We present a new algorithm (SATCHMO) that simultaneously estimates a tree and generates a set of multiple sequence alignments given a set of protein sequences. Alignments are constructed for each node in the tree. These alignments predict the structurally conserved elements of the sequences in a subtree and are therefore of different lengths, and represent different amino acid preferences, at different nodes. Hidden Markov Models (HMMs) are also generated for each node and are used to determine branching order, to align sequences and to predict structurally alignable regions. In experiments on the BAliBASE benchmark alignment database, SATCHMO is shown to perform comparably to ClustalW and the UCSC SAM HMM software. Results using SATCHMO to identify protein domains are demonstrated on potassium channels, with implications for the mechanism by which tumor necrosis factor alpha affects potassium current.

Algorithms↗
PubMed1995

A simple and fast approach to prediction of protein secondary structure from multiply aligned sequences with accuracy above 70%.

To improve secondary structure predictions in protein sequences, the information residing in multiple sequence alignments of substituted but structurally related proteins is exploited. A database comprised of 70 protein families and a total of 2,500 sequences, some of which were aligned by tertiary structural superpositions, was used to calculate residue exchange weight matrices within alpha-helical, beta-strand, and coil substructures, respectively. Secondary structure predictions were made based on the observed residue substitutions in local regions of the multiple alignments and the largest possible associated exchange weights in each of the three matrix types. Comparison of the observed and predicted secondary structure on a per-residue basis yielded a mean accuracy of 72.2%. Individual alpha-helix, beta-strand, and coil states were respectively predicted at 66.7, and 75.8% correctness, representing a well-balanced three-state prediction. The accuracy level, verified by cross-validation through jack-knife tests on all protein families, dropped, on average, to only 70.9%, indicating the rigor of the prediction procedure. On the basis of robustness, conceptual clarity, accuracy, and executable efficiency, the method has considerable advantage, especially with its sole reliance on amino acid substitutions within structurally related proteins.

Algorithms↗
PubMed2003

CLOURE: Clustal Output Reformatter, a program for reformatting ClustalX/ClustalW outputs for SNP analysis and molecular systematics.

We describe a program (and a website) to reformat the ClustalX/ClustalW outputs to a format that is widely used in the presentation of sequence alignment data in SNP analysis and molecular systematic studies. This program, CLOURE, CLustal OUtput REformatter, takes the multiple sequence alignment file (nucleic acid or protein) generated from Clustal as input files. The CLOURE-D format presents the Clustal alignment in a format that highlights only the different nucleotides/residues relative to the first query sequence. The program has been written in Visual Basic and will run on a Windows platform. The downloadable program, as well as a web-based server which has also been developed, can be accessed at http://imtech.res.in/~anand/cloure.html.

Internet↗
PubMed2003

THoR: a tool for domain discovery and curation of multiple alignments.

We describe a tool, THoR, that automatically creates and curates multiple sequence alignments representing protein domains. This exploits both PSI-BLAST and HMMER algorithms and provides an accurate and comprehensive alignment for any domain family. The entire process is designed for use via a web-browser, with simple links and cross-references to relevant information, to assist the assessment of biological significance. THoR has been benchmarked for accuracy using the SMART and pufferfish genome databases.

Algorithms↗
PubMed2003

Increased detection of structural templates using alignments of designed sequences.

Protein structure prediction by comparative modeling benefits greatly from the use of multiple sequence alignment information to improve the accuracy of structural template identification and the alignment of target sequences to structural templates. Unfortunately, this benefit is limited to those protein sequences for which at least several natural sequence homologues exist. We show here that the use of large diverse alignments of computationally designed protein sequences confers many of the same benefits as natural sequences in identifying structural templates for comparative modeling targets. A large-scale massively parallelized application of an all-atom protein design algorithm, including a simple model of peptide backbone flexibility, has allowed us to generate 500 diverse, non-native, high-quality sequences for each of 264 protein structures in our test set. PSI-BLAST searches using the sequence profiles generated from the designed sequences ("reverse" BLAST searches) give near-perfect accuracy in identifying true structural homologues of the parent structure, with 54% coverage. In 41 of 49 genomes scanned using reverse BLAST searches, at least one novel structural template (not found by the standard method of PSI-BLAST against PDB) is identified. Further improvements in coverage, through optimizing the scoring function used to design sequences and continued application to new protein structures beyond the test set, will allow this method to mature into a useful strategy for identifying distantly related structural templates.

Algorithms↗