Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Fastphylo: fast tools for phylogenetics.

ABSTRACT:

Background

Distance methods are ubiquitous tools in phylogenetics. Their primary purpose may be to reconstruct evolutionary history, but they are also used as components in bioinformatic pipelines. However, poor computational efficiency has been a constraint on the applicability of distance methods on very large problem instances.

Results

We present fastphylo, a software package containing implementations of efficient algorithms for two common problems in phylogenetics: estimating DNA/protein sequence distances and reconstructing a phylogeny from a distance matrix. We compare fastphylo with other neighbor joining based methods and report the results in terms of speed and memory efficiency.

Conclusions

Fastphylo is a fast, memory efficient, and easy to use software suite. Due to its modular architecture, fastphylo is a flexible tool for many phylogenetic studies.

SUBMITTER: Khan MA

PROVIDER: S-EPMC4225504 | biostudies-literature | 2013 Nov

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Fastphylo: fast tools for phylogenetics.

Khan Mehmood Alam MA Elias Isaac I Sjölund Erik E Nylander Kristina K Guimera Roman Valls RV Schobesberger Richard R Schmitzberger Peter P Lagergren Jens J Arvestad Lars L

BMC bioinformatics 20131120

<h4>Background</h4>Distance methods are ubiquitous tools in phylogenetics. Their primary purpose may be to reconstruct evolutionary history, but they are also used as components in bioinformatic pipelines. However, poor computational efficiency has been a constraint on the applicability of distance methods on very large problem instances.<h4>Results</h4>We present fastphylo, a software package containing implementations of efficient algorithms for two common problems in phylogenetics: estimating ...[more]

PMID: 24255987

Similar Datasets

Evaluating probabilistic programming and fast variational Bayesian inference in phylogenetics.

Project description:Recent advances in statistical machine learning techniques have led to the creation of probabilistic programming frameworks. These frameworks enable probabilistic models to be rapidly prototyped and fit to data using scalable approximation methods such as variational inference. In this work, we explore the use of the Stan language for probabilistic programming in application to phylogenetic models. We show that many commonly used phylogenetic models including the general time reversible substitution model, rate heterogeneity among sites, and a range of coalescent models can be implemented using a probabilistic programming language. The posterior probability distributions obtained via the black box variational inference engine in Stan were compared to those obtained with reference implementations of Markov chain Monte Carlo (MCMC) for phylogenetic inference. We find that black box variational inference in Stan is less accurate than MCMC methods for phylogenetic models, but requires far less compute time. Finally, we evaluate a custom implementation of mean-field variational inference on the Jukes-Cantor substitution model and show that a specialized implementation of variational inference can be two orders of magnitude faster and more accurate than a general purpose probabilistic implementation.

| S-EPMC6966998 | biostudies-literature

Parallel power posterior analyses for fast computation of marginal likelihoods in phylogenetics.

Project description:In Bayesian phylogenetic inference, marginal likelihoods can be estimated using several different methods, including the path-sampling or stepping-stone-sampling algorithms. Both algorithms are computationally demanding because they require a series of power posterior Markov chain Monte Carlo (MCMC) simulations. Here we introduce a general parallelization strategy that distributes the power posterior MCMC simulations and the likelihood computations over available CPUs. Our parallelization strategy can easily be applied to any statistical model despite our primary focus on molecular substitution models in this study. Using two phylogenetic example datasets, we demonstrate that the runtime of the marginal likelihood estimation can be reduced significantly even if only two CPUs are available (an average performance increase of 1.96x). The performance increase is nearly linear with the number of available CPUs. We record a performance increase of 13.3x for cluster nodes with 16 CPUs, representing a substantial reduction to the runtime of marginal likelihood estimations. Hence, our parallelization strategy enables the estimation of marginal likelihoods to complete in a feasible amount of time which previously needed days, weeks or even months. The methods described here are implemented in our open-source software RevBayes which is available from http://www.RevBayes.com.

| S-EPMC8570164 | biostudies-literature

UProC: tools for ultra-fast protein domain classification.

Project description:MOTIVATION: With rapidly increasing volumes of biological sequence data the functional analysis of new sequences in terms of similarities to known protein families challenges classical bioinformatics. RESULTS: The ultrafast protein classification (UProC) toolbox implements a novel algorithm ('Mosaic Matching') for large-scale sequence analysis. UProC is by three orders of magnitude faster than profile-based methods and in a metagenome simulation study achieved up to 80% higher sensitivity on unassembled 100?bp reads. AVAILABILITY AND IMPLEMENTATION: UProC is available as an open-source software at https://github.com/gobics/uproc. Precompiled databases (Pfam) are linked on the UProC homepage: http://uproc.gobics.de/. CONTACT: peter@gobics.de. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

| S-EPMC4410661 | biostudies-literature

PhyloMagnet: fast and accurate screening of short-read meta-omics data using gene-centric phylogenetics.

Project description:Motivation: Metagenomic and metatranscriptomic sequencing have become increasingly popular tools for producing massive amounts of short-read data, often used for the reconstruction of draft genomes or the detection of (active) genes in microbial communities. Unfortunately, sequence assemblies of such datasets generally remain a computationally challenging task. Frequently, researchers are only interested in a specific group of organisms or genes; yet, the assembly of multiple datasets only to identify candidate sequences for a specific question is sometimes prohibitively slow, forcing researchers to select a subset of available datasets to address their question. Here, we present PhyloMagnet, a workflow to screen meta-omics datasets for taxa and genes of interest using gene-centric assembly and phylogenetic placement of sequences.Results: Using PhyloMagnet, we could identify up to 87% of the genera in an in vitro mock community with variable abundances, while the false positive predictions per single gene tree ranged from 0 to 23%. When applied to a group of metagenomes for which a set of metagenome assembled genomes (MAGs) have been published, we could detect the majority of the taxonomic labels that the MAGs had been annotated with. In a metatranscriptomic setting, the phylogenetic placement of assembled contigs corresponds to that of transcripts obtained from transcriptome assembly.Availability and implementation: PhyloMagnet is built using Nextflow, available at github.com/maxemil/PhyloMagnet and is developed and tested on Linux. It is released under the open source GNU GPL licence and documentation is available at phylomagnet.readthedocs.io. Version 0.5 of PhyloMagnet was used for all benchmarking experiments.Supplementary information: Supplementary data are available at Bioinformatics online.

| S-EPMC7703773 | biostudies-literature

Dianthus phylogenetics

Project description:Taxonomy of Dianthus (Caryophyllaceae) – overall phylogenetic relationships and assessment of species diversity based on a first comprehensive checklist of the genus

| PRJEB48120 | ENA

Dianthus phylogenetics

Project description:A phylogenetic study of Dianthus

| PRJEB48122 | ENA

Acacia phylogenetics

Project description:Integration of Complete Chloroplast Genome Sequences with Small Amplicon Datasets Improves Phylogenetic Resolution in Acacia

| PRJEB10594 | ENA

Phylogenetics beyond biology.

Project description:Evolutionary processes have been described not only in biology but also for a wide range of human cultural activities including languages and law. In contrast to the evolution of DNA or protein sequences, the detailed mechanisms giving rise to the observed evolution-like processes are not or only partially known. The absence of a mechanistic model of evolution implies that it remains unknown how the distances between different taxa have to be quantified. Considering distortions of metric distances, we first show that poor choices of the distance measure can lead to incorrect phylogenetic trees. Based on the well-known fact that phylogenetic inference requires additive metrics, we then show that the correct phylogeny can be computed from a distance matrix [Formula: see text] if there is a monotonic, subadditive function [Formula: see text] such that [Formula: see text] is additive. The required metric-preserving transformation [Formula: see text] can be computed as the solution of an optimization problem. This result shows that the problem of phylogeny reconstruction is well defined even if a detailed mechanistic model of the evolutionary process remains elusive.

| S-EPMC6208858 | biostudies-other

Molecular phylogenetics - Molecular phylogenetics project (Palmblad et al. 2011)

Project description:Molecular phylogenetics project (Palmblad et al. 2011)

2012-01-11 | PRD000375 | Pride

The Centipede Genus Scolopendra in Mainland Southeast Asia: Molecular Phylogenetics, Geometric Morphometrics and External Morphology as Tools for Species Delimitation.

Project description:Seven Scolopendra species from the Southeast Asian mainland delimited based on standard external morphological characters represent monophyletic groups in phylogenetic trees inferred from concatenated sequences of three gene fragments (cytochrome c oxidase subunit 1, 16S rRNA and 28S rRNA) using Maximum likelihood and Bayesian inference. Geometric morphometric description of shape variation in the cephalic plate, forcipular coxosternite, and tergite of the ultimate leg-bearing segment provides additional criteria for distinguishing species. Colouration patterns in some Scolopendra species show a high degree of fit to phylogenetic trees at the population level. The most densely sampled species, Scolopendra dehaani Brandt, 1840, has three subclades with allopatric distributions in mainland SE Asia. The molecular phylogeny of S. pinguis Pocock, 1891, indicated ontogenetic colour variation among its populations. The taxonomic validation of S. dawydoffi Kronmüller, 2012, S. japonica Koch, 1878, and S. dehaani Brandt, 1840, each a former subspecies of S. subspinipes Leach, 1814 sensu Lewis, 2010, as full species was supported by molecular information and additional morphological data. Species delimitation in these taxonomically challenging animals is facilitated by an integrative approach that draws on both morphology and molecular phylogeny.

| S-EPMC4536039 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data