scholarly journals ParGenes: a tool for massively parallel model selection and phylogenetic tree inference on thousands of genes

2018 ◽  
Author(s):  
Benoit Morel ◽  
Alexey M. Kozlov ◽  
Alexandros Stamatakis
Keyword(s):  
Ad Hoc ◽  
Supplementary Information ◽  
Bootstrap Support ◽  
Large Set ◽  
Gene Trees ◽  
Sequence Alignments ◽  
Multiple Sequence ◽  
Individual Tree ◽  
Branch Support ◽  
Supplementary Material

ABSTRACTMotivationCoalescent- and reconciliation-based methods are now widely used to infer species phylogenies from genomic data. They typically use per-gene phylogenies as input, which requires conducting multiple individual tree inferences on a large set of multiple sequence alignments (MSAs). At present, no easy-to-use parallel tool for this task exists. Ad hoc scripts for this purpose do not only induce additional implementation overhead, but can also lead to poor resource utilization and long times-to-solution. We present ParGenes, a tool for simultaneously determining the best-fit model and inferring maximum likelihood (ML) phylogenies on thousands of independent MSAs using supercomputers.ResultsParGenes executes common phylogenetic pipeline steps such as model-testing, ML inference(s), bootstrapping, and computation of branch support values via a single parallel program invocation. We evaluated ParGenes by inferring > 20, 000 phylogenetic gene trees with bootstrap support values from Ensembl Compara and VectorBase alignments in 28 hours on a cluster with 1024 nodes.AvailabilityGNU GPL at https://github.com/BenoitMorel/[email protected] informationSupplementary material is available at Bioinformatics online.

Protein residues determining interaction specificity in paralogous families

2020 ◽  
Author(s):  
Borja Pitarch ◽  
Juan A G Ranea ◽  
Florencio Pazos
Keyword(s):  
Amino Acid ◽  
Fine Tuning ◽  
Supplementary Information ◽  
Sequence Information ◽  
Large Set ◽  
Supplementary Data ◽  
Sequence Alignments ◽  
Multiple Sequence ◽  
Multiple Sequence Alignments ◽  
Protein Residues

Abstract Motivation Predicting the residues controlling a protein’s interaction specificity is important not only to better understand its interactions but also to design mutations aimed at fine-tuning or swapping them as well. Results In this work, we present a methodology that combines sequence information (in the form of multiple sequence alignments) with interactome information to detect that kind of residues in paralogous families of proteins. The interactome is used to define pairwise similarities of interaction contexts for the proteins in the alignment. The method looks for alignment positions with patterns of amino-acid changes reflecting the similarities/differences in the interaction neighborhoods of the corresponding proteins. We tested this new methodology in a large set of human paralogous families with structurally characterized interactions, and discuss in detail the results for the RasH family. We show that this approach is a better predictor of interfacial residues than both, sequence conservation and an equivalent ‘unsupervised’ method that does not use interactome information. Availability and implementation http://csbg.cnb.csic.es/pazos/Xdet/. Supplementary information Supplementary data are available at Bioinformatics online.

VisFeature: a stand-alone program for visualizing and analyzing statistical features of biological sequences

2019 ◽  
Author(s):  
Jun Wang ◽  
Pu-Feng Du ◽  
Xin-Yu Xue ◽  
Guang-Ping Li ◽  
Yuan-Ke Zhou ◽  
...  
Keyword(s):  
Sequence Data ◽  
Software Tool ◽  
Data Retrieval ◽  
Supplementary Information ◽  
Statistical Features ◽  
Biological Sequence ◽  
Sequence Alignments ◽  
Multiple Sequence ◽  
Source Codes ◽  
Multiple Sequence Alignments

Abstract Summary Many efforts have been made in developing bioinformatics algorithms to predict functional attributes of genes and proteins from their primary sequences. One challenge in this process is to intuitively analyze and to understand the statistical features that have been selected by heuristic or iterative methods. In this paper, we developed VisFeature, which aims to be a helpful software tool that allows the users to intuitively visualize and analyze statistical features of all types of biological sequence, including DNA, RNA and proteins. VisFeature also integrates sequence data retrieval, multiple sequence alignments and statistical feature generation functions. Availability and implementation VisFeature is a desktop application that is implemented using JavaScript/Electron and R. The source codes of VisFeature are freely accessible from the GitHub repository (https://github.com/wangjun1996/VisFeature). The binary release, which includes an example dataset, can be freely downloaded from the same GitHub repository (https://github.com/wangjun1996/VisFeature/releases). Contact [email protected] or [email protected] Supplementary information Supplementary data are available at Bioinformatics online.

QuanTest2: benchmarking multiple sequence alignments using secondary structure prediction

2019 ◽  
Author(s):  
Fabian Sievers ◽  
Desmond G Higgins
Keyword(s):  
Secondary Structure ◽  
Structure Prediction ◽  
Secondary Structure Prediction ◽  
Reference Sequence ◽  
Supplementary Information ◽  
Sequence Alignments ◽  
Multiple Sequence ◽  
Multiple Sequence Alignments ◽  
Reference Sequences ◽  
Selection Of

Abstract Motivation Secondary structure prediction accuracy (SSPA) in the QuanTest benchmark can be used to measure accuracy of a multiple sequence alignment. SSPA correlates well with the sum-of-pairs score, if the results are averaged over many alignments but not on an alignment-by-alignment basis. This is due to a sub-optimal selection of reference and non-reference sequences in QuanTest. Results We develop an improved strategy for selecting reference and non-reference sequences for a new benchmark, QuanTest2. In QuanTest2, SSPA and SP correlate better on an alignment-by-alignment basis than in QuanTest. Guide-trees for QuanTest2 are more balanced with respect to reference sequences than in QuanTest. QuanTest2 scores correlate well with other well-established benchmarks. Availability and implementation QuanTest2 is available at http://bioinf.ucd.ie/quantest2.tar, comprises of reference and non-reference sequence sets and a scoring script. Supplementary information Supplementary data are available at Bioinformatics online

scholarly journals A fast and memory-efficient implementation of the transfer bootstrap

2019 ◽  
Vol 36 (7) ◽  
pp. 2280-2281 ◽  
Author(s):  
Sarah Lutteropp ◽  
Alexey M Kozlov ◽  
Alexandros Stamatakis
Keyword(s):  
General Public ◽  
Efficient Implementation ◽  
Supplementary Information ◽  
Bootstrap Support ◽  
Supplementary Data ◽  
Original Algorithm ◽  
Parallel Version ◽  
Branch Support ◽  
General Public License ◽  
Memory Efficient

Abstract Motivation Recently, Lemoine et al. suggested the transfer bootstrap expectation (TBE) branch support metric as an alternative to classical phylogenetic bootstrap support for taxon-rich datasets. However, the original TBE implementation in the booster tool is compute- and memory-intensive. Results We developed a fast and memory-efficient TBE implementation. We improve upon the original algorithm by Lemoine et al. via several algorithmic and technical optimizations. On empirical as well as on random tree sets with varying taxon counts, our implementation is up to 480 times faster than booster. Furthermore, it only requires memory that is linear in the number of taxa, which leads to 10× to 40× memory savings compared with booster. Availability and implementation Our implementation has been partially integrated into pll-modules and RAxML-NG and is available under the GNU Affero General Public License v3.0 at https://github.com/ddarriba/pll-modules and https://github.com/amkozlov/raxml-ng. The parallel version that also computes additional TBE-related statistics is available at: https://github.com/lutteropp/raxml-ng/tree/tbe. Supplementary information Supplementary data are available at Bioinformatics online.

Prediction of mutation effects using a deep temporal convolutional network

2019 ◽  
Vol 36 (7) ◽  
pp. 2047-2052 ◽  
Author(s):  
Ha Young Kim ◽  
Dongsup Kim
Keyword(s):  
Latent Variable ◽  
Sequence Data ◽  
Generative Model ◽  
Supplementary Information ◽  
Biological Research ◽  
Sequence Alignments ◽  
Variable Model ◽  
Convolutional Network ◽  
Direct Optimization ◽  
Multiple Sequence

Abstract Motivation Accurate prediction of the effects of genetic variation is a major goal in biological research. Towards this goal, numerous machine learning models have been developed to learn information from evolutionary sequence data. The most effective method so far is a deep generative model based on the variational autoencoder (VAE) that models the distributions using a latent variable. In this study, we propose a deep autoregressive generative model named mutationTCN, which employs dilated causal convolutions and attention mechanism for the modeling of inter-residue correlations in a biological sequence. Results We show that this model is competitive with the VAE model when tested against a set of 42 high-throughput mutation scan experiments, with the mean improvement in Spearman rank correlation ∼0.023. In particular, our model can more efficiently capture information from multiple sequence alignments with lower effective number of sequences, such as in viral sequence families, compared with the latent variable model. Also, we extend this architecture to a semi-supervised learning framework, which shows high prediction accuracy. We show that our model enables a direct optimization of the data likelihood and allows for a simple and stable training process. Availability and implementation Source code is available at https://github.com/ha01994/mutationTCN. Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals Revising transcriptome assemblies with phylogenetic information in Agalma1.0

2017 ◽  
Author(s):  
August Guang ◽  
Mark Howison ◽  
Felipe Zapata ◽  
Charles Lawrence ◽  
Casey Dunn
Keyword(s):  
Phylogenetic Analysis ◽  
Transcriptome Assembly ◽  
Phylogenetic Analyses ◽  
Supplementary Information ◽  
Gene Trees ◽  
Phylogenetic Information ◽  
Short Branch ◽  
Multiple Genes ◽  
Branch Lengths ◽  
Supplementary Material

AbstractMotivationOne of the most common transcriptome assembly errors is to mistake different transcripts of the same gene as transcripts from multiple closely related genes. It is difficult to identify these errors during assembly, but in a phylogenetic analysis these errors can be diagnosed from gene trees containing clades of tips from the same species with improbably short branch lengths.Resultstreeinform is a module implemented in Agalma1.0 that uses phylogenetic analyses across species to refine transcriptome assemblies. It identifies transcripts of the same gene that were incorrectly assigned to multiple genes and reassign them as transcripts of the same gene.Availability and Implementationtreeinform is implemented in Agalma1.0, available at https://bitbucket.org/caseywdunn/[email protected] informationSupplementary information is available at bioRxiv.

scholarly journals MSAC: Compression of multiple sequence alignment files

2017 ◽  
Author(s):  
Sebastian Deorowicz ◽  
Joanna Walczyszyn ◽  
Agnieszka Debudaj-Grabysz
Keyword(s):  
Sequence Alignment ◽  
Compression Ratio ◽  
Multiple Sequence Alignment ◽  
Sequence Alignments ◽  
Multiple Sequence ◽  
Multiple Sequence Alignments ◽  
Link Type ◽  
Bioinformatics Databases ◽  
Supplementary Material ◽  
Burrows Wheeler Transform

AbstractMotivationBioinformatics databases grow rapidly and achieve values hardly to imagine a decade ago. Among numerous bioinformatics processes generating hundreds of GB is multiple sequence alignments of protein families. Its largest database, i.e., Pfam, consumes 40–230 GB, depending of the variant. Storage and transfer of such massive data has become a challenge.ResultsWe propose a novel compression algorithm, MSAC (Multiple Sequence Alignment Compressor), designed especially for aligned data. It is based on a generalisation of the positional Burrows–Wheeler transform for non-binary alphabets. MSAC handles FASTA, as well as Stockholm files. It offers up to six times better compression ratio than other commonly used compressors, i.e., gzip. Performed experiments resulted in an analysis of the influence of a protein family size on the compression ratio.AvailabilityMSAC is available for free at https://github.com/refresh-bio/msac and http://sun.aei.polsl.pl/REFRESH/[email protected] materialSupplementary data are available at the publisher Web site.

scholarly journals RNA inter-nucleotide 3D closeness prediction by deep residual neural networks

2020 ◽  
Author(s):  
Saisai Sun ◽  
Wenkai Wang ◽  
Zhenling Peng ◽  
Jianyi Yang
Keyword(s):  
Neural Networks ◽  
Secondary Structure ◽  
Rna Structure ◽  
Supplementary Information ◽  
Sequence Alignments ◽  
Multiple Sequence ◽  
Guide Rna ◽  
Multiple Sequence Alignments ◽  
Contact Distance ◽  
Distance Restraints

Abstract Motivation Recent years have witnessed that the inter-residue contact/distance in proteins could be accurately predicted by deep neural networks, which significantly improve the accuracy of predicted protein structure models. In contrast, fewer studies have been done for the prediction of RNA inter-nucleotide 3D closeness. Results We proposed a new algorithm named RNAcontact for the prediction of RNA inter-nucleotide 3D closeness. RNAcontact was built based on the deep residual neural networks. The covariance information from multiple sequence alignments and the predicted secondary structure were used as the input features of the networks. Experiments show that RNAcontact achieves the respective precisions of 0.8 and 0.6 for the top L/10 and L (where L is the length of an RNA) predictions on an independent test set, significantly higher than other evolutionary coupling methods. Analysis shows that about 1/3 of the correctly predicted 3D closenesses are not base pairings of secondary structure, which are critical to the determination of RNA structure. In addition, we demonstrated that the predicted 3D closeness could be used as distance restraints to guide RNA structure folding by the 3dRNA package. More accurate models could be built by using the predicted 3D closeness than the models without using 3D closeness. Availability and implementation The webserver and a standalone package are available at: http://yanglab.nankai.edu.cn/RNAcontact/. Contact [email protected] Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals Analysis of several key factors influencing deep learning-based inter-residue contact prediction

2019 ◽  
Author(s):  
Tianqi Wu ◽  
Jie Hou ◽  
Badri Adhikari ◽  
Jianlin Cheng
Keyword(s):  
Deep Learning ◽  
Structural Information ◽  
Protein Structures ◽  
Supplementary Information ◽  
Prediction Methods ◽  
Key Factors ◽  
Sequence Alignments ◽  
Multiple Sequence ◽  
Contact Prediction ◽  
Ab Initio Approach

Abstract Motivation Deep learning has become the dominant technology for protein contact prediction. However, the factors that affect the performance of deep learning in contact prediction have not been systematically investigated. Results We analyzed the results of our three deep learning-based contact prediction methods (MULTICOM-CLUSTER, MULTICOM-CONSTRUCT and MULTICOM-NOVEL) in the CASP13 experiment and identified several key factors [i.e. deep learning technique, multiple sequence alignment (MSA), distance distribution prediction and domain-based contact integration] that influenced the contact prediction accuracy. We compared our convolutional neural network (CNN)-based contact prediction methods with three coevolution-based methods on 75 CASP13 targets consisting of 108 domains. We demonstrated that the CNN-based multi-distance approach was able to leverage global coevolutionary coupling patterns comprised of multiple correlated contacts for more accurate contact prediction than the local coevolution-based methods, leading to a substantial increase of precision by 19.2 percentage points. We also tested different alignment methods and domain-based contact prediction with the deep learning contact predictors. The comparison of the three methods showed deeper sequence alignments and the integration of domain-based contact prediction with the full-length contact prediction improved the performance of contact prediction. Moreover, we demonstrated that the domain-based contact prediction based on a novel ab initio approach of parsing domains from MSAs alone without using known protein structures was a simple, fast approach to improve contact prediction. Finally, we showed that predicting the distribution of inter-residue distances in multiple distance intervals could capture more structural information and improve binary contact prediction. Availability and implementation https://github.com/multicom-toolbox/DNCON2/. Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals PhyloToL: A Taxon/Gene-Rich Phylogenomic Pipeline to Explore Genome Evolution of Diverse Eukaryotes

2019 ◽  
Vol 36 (8) ◽  
pp. 1831-1842 ◽  
Author(s):  
Mario A Cerón-Romero ◽  
Xyrus X Maurer-Alcalá ◽  
Jean-David Grattepanche ◽  
Ying Yan ◽  
Miguel M Fonseca ◽  
...  
Keyword(s):  
Gene Family ◽  
High Throughput Sequencing ◽  
Stop Codon ◽  
Tree Of Life ◽  
Gene Family Evolution ◽  
Third Party ◽  
Gene Trees ◽  
Sequence Alignments ◽  
Multiple Sequence ◽  
Membrane Pore

Abstract Estimating multiple sequence alignments (MSAs) and inferring phylogenies are essential for many aspects of comparative biology. Yet, many bioinformatics tools for such analyses have focused on specific clades, with greatest attention paid to plants, animals, and fungi. The rapid increase in high-throughput sequencing (HTS) data from diverse lineages now provides opportunities to estimate evolutionary relationships and gene family evolution across the eukaryotic tree of life. At the same time, these types of data are known to be error-prone (e.g., substitutions, contamination). To address these opportunities and challenges, we have refined a phylogenomic pipeline, now named PhyloToL, to allow easy incorporation of data from HTS studies, to automate production of both MSAs and gene trees, and to identify and remove contaminants. PhyloToL is designed for phylogenomic analyses of diverse lineages across the tree of life (i.e., at scales of >100 My). We demonstrate the power of PhyloToL by assessing stop codon usage in Ciliophora, identifying contamination in a taxon- and gene-rich database and exploring the evolutionary history of chromosomes in the kinetoplastid parasite Trypanosoma brucei, the causative agent of African sleeping sickness. Benchmarking PhyloToL’s homology assessment against that of OrthoMCL and a published paper on superfamilies of bacterial and eukaryotic organellar outer membrane pore-forming proteins demonstrates the power of our approach for determining gene family membership and inferring gene trees. PhyloToL is highly flexible and allows users to easily explore HTS data, test hypotheses about phylogeny and gene family evolution and combine outputs with third-party tools (e.g., PhyloChromoMap, iGTP).

Sign in / Sign up

Export Citation Format

Share Document