DCAlign v1.0: aligning biological sequences using co-evolution models and informed priors.
Ontology highlight
ABSTRACT: Summary
DCAlign is a new alignment method able to cope with the conservation and the co-evolution signals that characterize the columns of multiple sequence alignments of homologous sequences. However, the pre-processing steps required to align a candidate sequence are computationally demanding. We show in v1.0 how to dramatically reduce the overall computing time by including an empirical prior over an informative set of variables mirroring the presence of insertions and deletions.Availability and implementation
DCAlign v1.0 is implemented in Julia and it is fully available at https://github.com/infernet-h2020/DCAlign.
SUBMITTER: Muntoni AP
PROVIDER: S-EPMC10491954 | biostudies-literature | 2023 Sep
REPOSITORIES: biostudies-literature
Publications
DCAlign v1.0: aligning biological sequences using co-evolution models and informed priors.
Muntoni Anna Paola AP Pagnani Andrea A
Bioinformatics (Oxford, England) 20230901 9
<h4>Summary</h4>DCAlign is a new alignment method able to cope with the conservation and the co-evolution signals that characterize the columns of multiple sequence alignments of homologous sequences. However, the pre-processing steps required to align a candidate sequence are computationally demanding. We show in v1.0 how to dramatically reduce the overall computing time by including an empirical prior over an informative set of variables mirroring the presence of insertions and deletions.<h4>A ...[more]
Similar Datasets
Project description:PurposeWe present a probabilistic approach to medical image analysis that requires, and makes use of, explicit prior information provided by a medical expert. Depending on the choice of prior model the method can be used for image enhancement, analysis, and segmentation.MethodsThe methodology is based on a probabilistic approach to medical image analysis, that allows integration of 1) arbitrarily complex prior information (for which realizations can be generated), 2) information about a convolution operator of the imaging system, and 3) information about the noise in the reconstructed image into a posterior probability density. The method was demonstrated on positron emission tomography (PET) images obtained from a phantom and a patient with lung cancer. The likelihood model (multivariate log-normal) and the convolution operator were derived from phantom data. Two examples of prior information were used to show the potential of the method. The extended Metropolis-Hastings algorithm, a Markov chain Monte Carlo method, was used to generate realizations of the posterior distribution of the tracer activity concentration.ResultsA set of realizations from the posterior was used as the base of a quantitative PET image analysis. The mean and variance of activity concentrations were computed, as well as the probability of high tracer uptake and statistics on the size and activity concentration of high uptake regions. For both phantom and in vivo images, the estimated images of mean activity concentrations appeared to have reduced noise levels, and a sharper outline of high activity regions, as compared to the original PET. The estimated variance of activity concentrations was high at the edges of high activity regions.ConclusionsThe methodology provides a probabilistic approach for medical image analysis that explicitly takes into account medical expert knowledge as prior information. The presented first results indicate the potential of the method to improve the detection of small lesions. The methodology allows for a probabilistic measure of the size and activity level of high uptake regions, with possible long-term perspectives for early detection of cancer, as well as treatment, planning, and follow-up.
| S-EPMC11459987 | biostudies-literature
Project description:Sequence-to-graph alignment is crucial for applications such as variant genotyping, read error correction, and genome assembly. We propose a novel seeding approach that relies on long inexact matches rather than short exact matches, and show that it yields a better time-accuracy trade-off in settings with up to a [Formula: see text] mutation rate. We use sketches of a subset of graph nodes, which are more robust to indels, and store them in a k-nearest neighbor index to avoid the curse of dimensionality. Our approach contrasts with existing methods and highlights the important role that sketching into vector space can play in bioinformatics applications. We show that our method scales to graphs with 1 billion nodes and has quasi-logarithmic query time for queries with an edit distance of [Formula: see text] For such queries, longer sketch-based seeds yield a [Formula: see text] increase in recall compared with exact seeds. Our approach can be incorporated into other aligners, providing a novel direction for sequence-to-graph alignment.
| S-EPMC10538362 | biostudies-literature
Project description:BackgroundWe investigate whether annotation of gene function can be improved using a classification scheme that is aware that functional classes are organized in a hierarchy. The classifiers look at phylogenic descriptors, sequence based attributes, and predicted secondary structure. We discuss three Bayesian models and compare their performance in terms of predictive accuracy. These models are the ordinary multinomial logit (MNL) model, a hierarchical model based on a set of nested MNL models, and an MNL model with a prior that introduces correlations between the parameters for classes that are nearby in the hierarchy. We also provide a new scheme for combining different sources of information. We use these models to predict the functional class of Open Reading Frames (ORFs) from the E. coli genome.ResultsThe results from all three models show substantial improvement over previous methods, which were based on the C5 decision tree algorithm. The MNL model using a prior based on the hierarchy outperforms both the non-hierarchical MNL model and the nested MNL model. In contrast to previous attempts at combining the three sources of information in this dataset, our new approach to combining data sources produces a higher accuracy rate than applying our models to each data source alone.ConclusionTogether, these results show that gene function can be predicted with higher accuracy than previously achieved, using Bayesian models that incorporate suitable prior information.
| S-EPMC1618412 | biostudies-literature
Project description:The information criterion of minimum message length (MML) provides a powerful statistical framework for inductive reasoning from observed data. We apply MML to the problem of protein sequence comparison using finite state models with Dirichlet distributions. The resulting framework allows us to supersede the ad hoc cost functions commonly used in the field, by systematically addressing the problem of arbitrariness in alignment parameters, and the disconnect between substitution scores and gap costs. Furthermore, our framework enables the generation of marginal probability landscapes over all possible alignment hypotheses, with potential to facilitate the users to simultaneously rationalize and assess competing alignment relationships between protein sequences, beyond simply reporting a single (best) alignment. We demonstrate the performance of our program on benchmarks containing distantly related protein sequences.Availability and implementationThe open-source program supporting this work is available from: http://lcb.infotech.monash.edu.au/seqmmligner.Supplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC6612809 | biostudies-literature
Project description:Functional concurrent, or varying-coefficient, regression models are a form of functional data analysis methods in which functional covariates and outcomes are collected concurrently. Two active areas of research for this class of models are identifying influential functional covariates and clustering their relations across observations. In various applications, researchers have applied and developed methods to address these objectives separately. However, no approach currently performs both tasks simultaneously. In this paper, we propose a fully Bayesian functional concurrent regression mixture model that simultaneously performs functional variable selection and clustering for subject-specific trajectories. Our approach introduces a novel spiked Ewens-Pitman attraction prior that identifies and clusters subjects' trajectories marginally for each functional covariate while using similarities in subjects' auxiliary covariate patterns to inform clustering allocation. Using simulated data, we evaluate the clustering, variable selection, and parameter estimation performance of our approach and compare its performance with alternative spiked processes. We then apply our method to functional data collected in a novel, smartphone-based smoking cessation intervention study to investigate individual-level dynamic relations between smoking behaviors and potential risk factors.
| S-EPMC11507269 | biostudies-literature
Project description:BackgroundFrameshift translation is an important phenomenon that contributes to the appearance of novel coding DNA sequences (CDS) and functions in gene evolution, by allowing alternative amino acid translations of gene coding regions. Frameshift translations can be identified by aligning two CDS, from a same gene or from homologous genes, while accounting for their codon structure. Two main classes of algorithms have been proposed to solve the problem of aligning CDS, either by amino acid sequence alignment back-translation, or by simultaneously accounting for the nucleotide and amino acid levels. The former does not allow to account for frameshift translations and up to now, the latter exclusively accounts for frameshift translation initiation, not considering the length of the translation disruption caused by a frameshift.ResultsWe introduce a new scoring scheme with an algorithm for the pairwise alignment of CDS accounting for frameshift translation initiation and length, while simultaneously considering nucleotide and amino acid sequences. The main specificity of the scoring scheme is the introduction of a penalty cost accounting for frameshift extension length to compute an adequate similarity score for a CDS alignment. The second specificity of the model is that the search space of the problem solved is the set of all feasible alignments between two CDS. Previous approaches have considered restricted search space or additional constraints on the decomposition of an alignment into length-3 sub-alignments. The algorithm described in this paper has the same asymptotic time complexity as the classical Needleman-Wunsch algorithm.ConclusionsWe compare the method to other CDS alignment methods based on an application to the comparison of pairs of CDS from homologous human, mouse and cow genes of ten mammalian gene families from the Ensembl-Compara database. The results show that our method is particularly robust to parameter changes as compared to existing methods. It also appears to be a good compromise, performing well both in the presence and absence of frameshift translations. An implementation of the method is available at https://github.com/UdeS-CoBIUS/FsePSA.
| S-EPMC5374649 | biostudies-literature
Project description:Strategic conservation efforts for cryptic species, especially bats, are hindered by limited understanding of distribution and population trends. Integrating long-term encounter surveys with multi-season occupancy models provides a solution whereby inferences about changing occupancy probabilities and latent changes in abundance can be supported. When harnessed to a Bayesian inferential paradigm, this modeling framework offers flexibility for conservation programs that need to update prior model-based understanding about at-risk species with new data. This scenario is exemplified by a bat monitoring program in the Pacific Northwestern United States in which results from 8 years of surveys from 2003 to 2010 require updating with new data from 2016 to 2018. The new data were collected after the arrival of bat white-nose syndrome and expansion of wind power generation, stressors expected to cause population declines in at least two vulnerable species, little brown bat (Myotis lucifugus) and the hoary bat (Lasiurus cinereus). We used multi-season occupancy models with empirically informed prior distributions drawn from previous occupancy results (2003-2010) to assess evidence of contemporary decline in these two species. Empirically informed priors provided the bridge across the two monitoring periods and increased precision of parameter posterior distributions, but did not alter inferences relative to use of vague priors. We found evidence of region-wide summertime decline for the hoary bat ( λ^ = 0.86 ± 0.10) since 2010, but no evidence of decline for the little brown bat ( λ^ = 1.1 ± 0.10). White-nose syndrome was documented in the region in 2016 and may not yet have caused regional impact to the little brown bat. However, our discovery of hoary bat decline is consistent with the hypothesis that the longer duration and greater geographic extent of the wind energy stressor (collision and barotrauma) have impacted the species. These hypotheses can be evaluated and updated over time within our framework of pre-post impact monitoring and modeling. Our approach provides the foundation for a strategic evidence-based conservation system and contributes to a growing preponderance of evidence from multiple lines of inquiry that bat species are declining.
| S-EPMC6802066 | biostudies-literature
Project description:BackgroundMolecular evolution studies involve many different hard computational problems solved, in most cases, with heuristic algorithms that provide a nearly optimal solution. Hence, diverse software tools exist for the different stages involved in a molecular evolution workflow.ResultsWe present MEvoLib, the first molecular evolution library for Python, providing a framework to work with different tools and methods involved in the common tasks of molecular evolution workflows. In contrast with already existing bioinformatics libraries, MEvoLib is focused on the stages involved in molecular evolution studies, enclosing the set of tools with a common purpose in a single high-level interface with fast access to their frequent parameterizations. The gene clustering from partial or complete sequences has been improved with a new method that integrates accessible external information (e.g. GenBank's features data). Moreover, MEvoLib adjusts the fetching process from NCBI databases to optimize the download bandwidth usage. In addition, it has been implemented using parallelization techniques to cope with even large-case scenarios.ConclusionsMEvoLib is the first library for Python designed to facilitate molecular evolution researches both for expert and novel users. Its unique interface for each common task comprises several tools with their most used parameterizations. It has also included a method to take advantage of biological knowledge to improve the gene partition of sequence datasets. Additionally, its implementation incorporates parallelization techniques to enhance computational costs when handling very large input datasets.
| S-EPMC5084326 | biostudies-literature
Project description:We introduce a probabilistic computer vision technique to track monotonically advancing boundaries of objects within image sequences. Our method incorporates a novel technique for including statistical prior shape information into graph-cut based segmentation, with the aid of a majorization-minimization algorithm. Extension of segmentation from single images to image sequences then follows naturally using sequential Bayesian estimation. Our methodology is applied to two unrelated sets of real biomedical imaging data, and a set of synthetic images. Our results are shown to be superior to manual segmentation.
| S-EPMC5510452 | biostudies-literature
Project description:We define a "threaded blockset," which is a novel generalization of the classic notion of a multiple alignment. A new computer program called TBA (for "threaded blockset aligner") builds a threaded blockset under the assumption that all matching segments occur in the same order and orientation in the given sequences; inversions and duplications are not addressed. TBA is designed to be appropriate for aligning many, but by no means all, megabase-sized regions of multiple mammalian genomes. The output of TBA can be projected onto any genome chosen as a reference, thus guaranteeing that different projections present consistent predictions of which genomic positions are orthologous. This capability is illustrated using a new visualization tool to view TBA-generated alignments of vertebrate Hox clusters from both the mammalian and fish perspectives. Experimental evaluation of alignment quality, using a program that simulates evolutionary change in genomic sequences, indicates that TBA is more accurate than earlier programs. To perform the dynamic-programming alignment step, TBA runs a stand-alone program called MULTIZ, which can be used to align highly rearranged or incompletely sequenced genomes. We describe our use of MULTIZ to produce the whole-genome multiple alignments at the Santa Cruz Genome Browser.
| S-EPMC383317 | biostudies-literature