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 55 records · Page 3Linked to original sources

PubMed1991

MASH: an interactive program for multiple alignment and consensus sequence construction for biological sequences.

This paper presents a method for the multiple alignment of a sequence set. The MASH algorithm uses a non-redundant database of common motifs and an 'alignment priority' criterion that depends on the length and the occurrence frequency of the patterns in the set of sequences. This user-defined criterion allows the determination of the series of the patterns to be aligned. This program is applied to a fragment of envelope gene env gp120 for 20 isolates of the immunodeficiency virus. The multiplicity of alignments obtained by modifying the criterion parameters reveals different aspects of similarity between the sequences.

Algorithms↗

PubMed1987

A strategy for the rapid multiple alignment of protein sequences. Confidence levels from tertiary structure comparisons.

An algorithm is presented for the multiple alignment of protein sequences that is both accurate and rapid computationally. The approach is based on the conventional dynamic-programming method of pairwise alignment. Initially, two sequences are aligned, then the third sequence is aligned against the alignment of both sequences one and two. Similarly, the fourth sequence is aligned against one, two and three. This is repeated until all sequences have been aligned. Iteration is then performed to yield a final alignment. The accuracy of sequence alignment is evaluated from alignment of the secondary structures in a family of proteins. For the globins, the multiple alignment was on average 99% accurate compared to 90% for pairwise comparison of sequences. For the alignment of immunoglobulin constant and variable domains, the use of many sequences yielded an alignment of 63% average accuracy compared to 41% average for individual variable/constant alignments. The multiple alignment algorithm yields an assignment of disulphide connectivity in mammalian serotransferrin that is consistent with crystallographic data, whereas pairwise alignments give an alternative assignment.

Algorithms↗

PubMed1990

Optimal sequence alignment allowing for long gaps.

A new algorithm for optimal sequence alignment allowing for long insertions and deletions is developed. The algorithm requires O((L+C)MN) computational steps, O(LN) primary memory and O(MN) secondary memory storage, where M and N(M greater than or equal to N) are sequence lengths, L(typically L less than or greater than 3) is the number of segment specifying the gap weighting function, and C is a constant. We have also modified our earlier traceback algorithm so that it finds all and and only the optimal alignments in a compact form of a directed graph. The current versions accept a set of aligned sequences as input, which facilitates multiple sequence alignment by some iterative procedures.

Algorithms↗

PubMed2026

Theseus: fast and optimal affine-gap sequence-to-graph alignment.

MOTIVATION: Sequence-to-graph alignment is a central problem in bioinformatics, with applications in multiple sequence alignment (MSA) and pangenome analysis, among others. However, current algorithms for optimal affine-gap alignment impose high memory and computational requirements, limiting their scalability to aligning long sequences to complex graphs. Practical solutions partially address this problem using heuristic strategies that ultimately trade off optimality for speed. RESULTS: This work presents Theseus, a novel, fast, and optimal affine-gap sequence-to-graph alignment algorithm. Theseus leverages similarities between genomic sequences to accelerate the alignment computation and reduces the overall memory requirements without compromising optimality. To that end, Theseus processes only a subset of the dynamic programming cells, using a sparse-data strategy that enables efficient sequence-to-graph alignment. Moreover, our algorithm supports optimal affine-gap alignment on arbitrary directed graphs, including those with cycles. We evaluate Theseus on two key problems: MSA and pangenome read mapping. For MSA, we compare it against SPOA, abPOA, and POASTA. Theseus is 1.6× to 17.6× faster than POASTA, and 7.3× faster, on average, than SPOA, both optimal aligners. Compared with abPOA, Theseus ensures optimality and scales to the largest problems. For pangenome read mapping, we benchmark Theseus against the alignment stage of the mapping tool vg map, along with the alignment kernels of SPOA, abPOA, and POASTA. Theseus outperforms the other methods, showing a 1.9× to 16.9× speedup on short reads. Moreover, Theseus is 1.5× to 36.3× faster than vg when aligning against synthetic cyclic graphs. AVAILABILITY AND IMPLEMENTATION: Theseus code and documentation are publicly available at https://github.com/albertjimenezbl/theseus-lib.

Algorithms↗

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↗

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↗

PubMed1991

Motif recognition and alignment for many sequences by comparison of dot-matrices.

Calculation of dot-matrices is a widespread tool in the search for sequence similarities. When sequences are distant, even this approach may fail to point out common regions. If several plots calculated for all members of a sequence set consistently displayed a similarity between them, this would increase its credibility. We present an algorithm to delineate dot-plot agreement. A novel procedure based on matrix multiplication is developed to identify common patterns and reliably aligned regions in a set of distantly related sequences. The algorithm finds motifs independent of input sequence lengths and reduces the dependence on gap penalties. When sequences share greater similarity, the same approach converts to a multiple sequence alignment procedure.

Algorithms↗

PubMed1990

Consistency of optimal sequence alignments.

Pairwise optimal alignments between three or more sequences are not necessarily consistent as a whole, but consistent and inconsistent residues are usually distributed in clusters. An efficient method has been developed for locating consistent regions when each pairwise alignment is given in the form of a "skeletal representation" (Bull. math. Biol. 52, 359-373). This method is further extended so that the combination of pairwise alignments that gives the greatest consistency is found when possibly many alignments are equally optimal for each pairwise comparison. A method for acceleration of simultaneous multiple sequence alignment is proposed in which consistent regions serve as "anchor points" limiting application of direct multi-way alignment to the rest of "inconsistent" regions.

Algorithms↗

PubMed1992

Phylogenetic relationships of three porcine mycoplasmas, Mycoplasma hyopneumoniae, Mycoplasma flocculare, and Mycoplasma hyorhinis, and complete 16S rRNA sequence of M. flocculare.

The nucleotide sequence of the 16S rRNA gene of Mycoplasma flocculare was determined and was compared with the sequence of a related porcine mycoplasma, Mycoplasma hyopneumoniae. While the overall level of DNA-DNA homology was approximately 11%, sequence alignment of the two 16S rRNA genes yielded a homology value of more than 95%, emphasizing the highly conserved nature of the 16S rRNA gene. Multiple sequence alignments with other mollicutes indicated that M. flocculare, M. hyopneumoniae, and Mycoplasma hyorhinis form a subcluster within the fermentans phylogroup, and this subcluster is distinct from the Mycoplasma pneumoniae phylogroup. Thus, the three mycoplasmas isolated from porcine respiratory systems exhibit phylogenetic similarities.

Animals↗

PubMed2026

Whole genome sequencing of unusual Hepatitis C virus subtypes and drug resistance analysis during direct-acting antiviral therapy in India.

INTRODUCTION AND OBJECTIVES: Pangenotypic direct-acting antivirals (DAA) are effective against highly prevalent Hepatitis C virus (HCV) subtypes, but have been clinically validated almost exclusively in high-income countries. Unusual HCV subtypes may carry natural polymorphisms, potentially impacting DAA susceptibility. We conducted full-genome characterization and resistance analysis of unusual HCV subtypes in patients receiving DAA treatment. PATIENTS AND METHODS: In this prospective hospital-based study, eligible patients were screened for anti-HCV antibodies and active infection was confirmed by diagnostic 5'NCR-based HCV RNA detection. Genotyping was performed by core region sequencing, and viral load quantified by real-time PCR. For whole genome sequencing, multiplex primers were designed using alignments of global reference sequences. Sequencing was carried out using the Oxford Nanopore Technology platform. Phylogenetic analysis used multiple sequence alignment and the HCV-GLUE resource for resistance-associated substitution (RAS) analysis. RESULTS: Predominant genotype was genotype 3 in 64.3% (n = 45); genotype 6 in 21.4% (n = 15); and genotype 1 in 14.2% (n = 10). Unusual HCV subtype 6xa was detected in two patients and showed no NS5A resistance mutations. One genotype 3b patient relapsed at 24 weeks post-DAA treatment completion and carried NS5A resistance-associated substitutions 30 K and 31 M both at baseline and at relapse, conferring high-level resistance to NS5A inhibitors. CONCLUSION: This is the first report from India of whole genome sequencing of HCV subtype 6xa. The identification of NS5A resistance mutations in the 3b relapse case underscores challenges for global HCV elimination strategies.

Humans↗

PubMed1991

Suboptimal sequence alignment in molecular biology. Alignment with error analysis.

A molecular sequence alignment algorithm based on dynamic programming has been extended to allow the computation of all pairs of residues that can be part of optimal and suboptimal sequence alignments. The uncertainties inherent in sequence alignment can be displayed using a new form of dot plot. The method allows the qualitative assessment of whether or not two sequences are related, and can reveal what parts of the alignment are better determined than others. It also permits the computation of representative optimal and suboptimal alignments. The relation between alignment reliability and alignment parameters is discussed. Other applications are to cyclical permutations of sequences and the detection of self-similarity. An application to multiple sequence alignment is noted.

Algorithms↗

PubMed1991

Amino acid sequence analysis of the annexin super-gene family of proteins.

The annexins are a widespread family of calcium-dependent membrane-binding proteins. No common function has been identified for the family and, until recently, no crystallographic data existed for an annexin. In this paper we draw together 22 available annexin sequences consisting of 88 similar repeat units, and apply the techniques of multiple sequence alignment, pattern matching, secondary structure prediction and conservation analysis to the characterisation of the molecules. The analysis clearly shows that the repeats cluster into four distinct families and that greatest variation occurs within the repeat 3 units. Multiple alignment of the 88 repeats shows amino acids with conserved physicochemical properties at 22 positions, with only Gly at position 23 being absolutely conserved in all repeats. Secondary structure prediction techniques identify five conserved helices in each repeat unit and patterns of conserved hydrophobic amino acids are consistent with one face of a helix packing against the protein core in predicted helices a, c, d, e. Helix b is generally hydrophobic in all repeats, but contains a striking pattern of repeat-specific residue conservation at position 31, with Arg in repeats 4 and Glu in repeats 2, but unconserved amino acids in repeats 1 and 3. This suggests repeats 2 and 4 may interact via a buried saltbridge. The loop between predicted helices a and b of repeat 3 shows features distinct from the equivalent loop in repeats 1, 2 and 4, suggesting an important structural and/or functional role for this region. No compelling evidence emerges from this study for uteroglobin and the annexins sharing similar tertiary structures, or for uteroglobin representing a derivative of a primordial one-repeat structure that underwent duplication to give the present day annexins. The analyses performed in this paper are re-evaluated in the Appendix, in the light of the recently published X-ray structure for human annexin V. The structure confirms most of the predictions and shows the power of techniques for the determination of tertiary structural information from the amino acid sequences of an aligned protein family.

Algorithms↗

PubMed1992

An ATPase domain common to prokaryotic cell cycle proteins, sugar kinases, actin, and hsp70 heat shock proteins.

The functionally diverse actin, hexokinase, and hsp70 protein families have in common an ATPase domain of known three-dimensional structure. Optimal superposition of the three structures and alignment of many sequences in each of the three families has revealed a set of common conserved residues, distributed in five sequence motifs, which are involved in ATP binding and in a putative interdomain hinge. From the multiple sequence alignment in these motifs a pattern of amino acid properties required at each position is defined. The discriminatory power of the pattern is in part due to the use of several known three-dimensional structures and many sequences and in part to the "property" method of generalizing from observed amino acid frequencies to amino acid fitness at each sequence position. A sequence data base search with the pattern significantly matches sugar kinases, such as fuco-, glucono-, xylulo-, ribulo-, and glycerokinase, as well as the prokaryotic cell cycle proteins MreB, FtsA, and StbA. These are predicted to have subdomains with the same tertiary structure as the ATPase subdomains Ia and IIa of hexokinase, actin, and Hsc70, a very similar ATP binding pocket, and the capacity for interdomain hinge motion accompanying functional state changes. A common evolutionary origin for all of the proteins in this class is proposed.

Actins↗

PubMed2025

Modeling Alternative Conformational States in CASP16.

The CASP16 Ensemble Prediction experiment assessed advances in methods for modeling proteins, nucleic acids, and their complexes in multiple conformational states. Targets included systems with experimental structures determined in two or three states, evaluated by direct comparison to experimental coordinates, as well as domain-linker-domain (D-L-D) targets assessed against statistical models from NMR and SAXS data. This paper focuses on the former class of multi-state targets. Ten ensembles were released as community challenges, including ligand-induced conformational changes, protein-DNA complexes, a trimeric protein, a stem-loop RNA, and multiple oligomeric states of a single RNA. For five targets, some groups produced reasonably accurate models of both reference states (best TM-score >0.75). However, with the exception of one protein-ligand complex (T1214), where an apo structure was available as a template, predictors generally failed to capture key structural details distinguishing the states. Overall, accuracy was significantly lower than for single-state targets in other CASP experiments. The most successful approaches generated multiple AlphaFold2 models using enhanced multiple sequence alignments and sampling protocols, followed by model quality based selection. While the AlphaFold3 server performed well on several targets, individual groups outperformed it in specific cases. By contrast, predictions for one protein-DNA complex, three RNA targets, and multiple oligomeric RNA states consistently fell short (TM-score <0.75). These results highlight both progress and persistent challenges in multi-state prediction. Despite recent advances, accurate modeling of conformational ensembles, particularly RNA and large multimeric assemblies, remains a critical frontier for structural biology.

AlphaFold2↗

PubMed1990

Consensus patterns in DNA.

Matrices can provide realistic representations of protein/DNA specificity. In many cases simple mononucleotide-based matrices are adequate representations, but more complex matrices may be needed for other cases. Unlike simple consensus sequences, matrices allow for different penalties to be assessed for different changes to a binding site, a property that is essential for accurate description of a binding site pattern. When only a collection of binding site sequences is known, the best representation for the pattern is an information content formulation, based on both thermodynamic and statistical considerations. Quantitative data on relative binding affinities may be used to determine matrices that provide a best fit to the data. Matrix representations also provide an efficient method of aligning multiple sequences to identify binding site patterns that they have in common.

Base Sequence↗

PubMed2026

Genetic diversity and recombination of NA-PRRSV field strains in Vietnam: Implications for vaccine efficacy.

Porcine reproductive and respiratory syndrome (PRRS) causes severe reproductive losses in pregnant sows and piglets, resulting in substantial economic impact on the swine industry worldwide. However, due to the significant genetic diversity and rapid evolutionary changes of the pathogen, continuous surveillance and detailed genetic analysis of circulating strains are essential. The current study aimed to evaluate the genetic diversity of the hypervariable (HV) region of non-structural protein 2 (nsp2) among North American PRRSV strains isolated from swine farms in Vietnam. Phylogenetic analysis and multiple sequence alignment were conducted to determine subtype classification and assess genetic variability. A total of 48 field isolates were obtained, of which 12.5% belonged to classical NA-PRRSV, 16.6% to NADC30-like and 70.9% to HP-PRRSV, primarily distributed across sublineages 1.4, 5.1, 8.7 and 8.9. Amino acid comparisons found multiple insertions, deletions and substitutions at various positions within the hypervariable region of nsp2. The study revealed substantial genetic variation in the HV region of nsp2 among NA-PRRSV field strains, largely associated with recombination and immune escape. These findings highlight epidemiological risks to vaccine efficacy and underscore the need for continuous molecular surveillance to support effective PRRSV control in Vietnam.

PRRSV↗

PubMed2026

Development and epidemiological investigation of a TaqMan-based multiplex real-time quantitative PCR assay for simultaneous detection of five bovine viruses (BVDV, AKAV, BNoV, BEV, and BCoV).

INRODUCTION: Infectious diseases caused by bovine viral diarrhea virus (BVDV), Akabane virus (AKAV), bovine norovirus (BNoV), bovine enterovirus (BEV), and bovine coronavirus (BCoV) significantly threaten the cattle industry, resulting in substantial economic losses. These pathogens often present similar clinical signs, such as diarrhea, vomiting, and reproductive disorders in pregnant cattle, and frequent covert or mixed infections further complicate accurate diagnosis. Therefore, rapid, sensitive, and field‑deployable diagnostic methods are essential for effective disease surveillance and control in the cattle industry. METHODS: In this study, we report for the first time the establishment of a TaqMan‑based real‑time quantitative PCR (qPCR) assay that enables simultaneous detection of these five bovine viruses. Multiple sequence alignment of conserved genomic regions was performed, and virus‑specific primers and probes were designed and optimized using Beacon Designer 7 software. Subsequently, a TaqMan‑based multiplex real‑time qPCR assay was established for simultaneous detection of BVDV, AKAV, BNoV, BEV, and BCoV. The established detection method was applied to 200 clinical samples collected from 10 farms in multiple regions of Jilin Province. RESULTS: The results showed that the detection rates for BVDV, AKAV, BNoV, BEV, and BCoV were 33.50%, 0.50%, 4.50%, 7.50%, and 12.00%, respectively. Mixed infections were detected in 9 samples co‑infected with two of the five pathogens, with an overall mixed infection rate of 4.50%. Compared with conventional PCR, coincidence rates were 100% for BVDV, AKAV, BNoV, BEV, and BCoV. DISCUSSION: These findings indicate that the TaqMan multiplex real‑time qPCR assay developed here demonstrates favorable specificity, sensitivity, and reproducibility. This assay enables efficient detection and surveillance of bovine viruses, offering a reliable technical tool for the diagnosis and control of corresponding viral diseases in cattle.

Akabane virus (AKAV)↗

PubMed1989

Molecular analysis of pleckstrin: the major protein kinase C substrate of platelets.

Activation of protein kinase C (PKC) in platelets causes the immediate phosphorylation of pleckstrin, an apparent Mr 40-47,000 protein previously called 40K or P47. Pleckstrin presumably plays an important but as yet unknown role in mediating cellular responses evoked by agonist-induced phosphoinositide turnover. We have cloned the cDNA for pleckstrin from the HL-60 human promyelocytic leukemia cell line by immunological screening of a lambda gt11 expression library (Tyers et al.: Nature 333:470-473, 1988) and now report further analysis of the pleckstrin sequence. Pleckstrin has a deduced Mr of 40,087 and is encoded by a 1,050-bp open reading frame which is preceded by a short open reading frame that terminates before the correct initiator methionine. A single polymorphic site was found in the coding region. An unusual pattern of sequence heterogeneity occurred about a poly(A) tract in the 3' untranslated region. The 3.0-kb pleckstrin mRNA induced upon differentiation of HL-60 cells apparently has heterogeneous 5' ends which undergo differential regulation during HL-60 cell maturation. Analysis by multiple sequence alignment with known PKC substrates identified a strong candidate site for phosphorylation by PKC and a potential Ca2+-binding EF-hand motif. No other similarities to proteins in current databases were found.

Amino Acid Sequence↗