Search

Phylogenetic trees represent the evolutionary relationships and ancestry of various species or groups of organisms. Comparing these trees by measuring the distance between them is essential for applications such as tree clustering and the Tree of Life project. Many distance metrics for phylogenetic trees focus on trees defined on the same set of taxa. However, some problems require calculating distances between trees with different but overlapping sets of taxa. This study reviews state‐of‐the‐art distance measures for such trees, covering six major approaches, including the constraint‐based Robinson–Foulds (RF) distance RF(−), the completion‐based RF(+), the generalized RF (GRF), the dissimilarity measure, the vectorial tree distance, and the geodesic distance in the extended Billera‐Holmes‐Vogtmann tree space. Among these, three RF‐based methods, RF(−), RF(+), and GRF, were examined in detail on generated clusters of phylogenetic trees defined on different but mutually overlapping sets of taxa. Additionally, we reviewed nine related techniques, including leaf imputation methods, the tree edit distance, and visual comparison. A comparison of the related distance measures, highlighting their principal advantages and shortcomings, is provided. This review offers valuable insights into their applicability and performance, guiding the appropriate use of these metrics based on tree type (rooted or unrooted) and information type (topological or branch lengths). [ABSTRACT FROM AUTHOR]

Swine acute diarrhoea syndrome coronavirus (SADS-CoV; Coronaviridae, Rhinacovirus) was detected in 2017 in Guangdong Province (China), where it caused high mortality rates in piglets. According to previous studies, SADS-CoV evolved from horseshoe bat reservoirs. Here, we report the first five Rhinacovirus genomes sequenced in horseshoe bats from Vietnam and their comparisons with data published in China. Our phylogenetic analyses provided evidence for four groups: rhinacoviruses from Rhinolphus pusillus bats, including one from Vietnam; bat rhinacoviruses from Hainan; bat rhinacoviruses from Yunnan showing a divergent synonymous nucleotide composition; and SADS-CoV and related bat viruses, including four rhinacoviruses from Vietnam sampled in Rhinolophus affinis and Rhinolophus thomasi. Our phylogeographic analyses showed that bat rhinacoviruses from Dien Bien (Vietnam) share more affinities with those from Yunnan (China) and that the ancestor of SADS-CoVs arose in Rhinolophus affinis circulating in Guangdong. We detected sequencing errors and artificial chimeric genomes in published data. The two SADS-CoV genomes previously identified as recombinant could also be problematic. The reliable data currently available, therefore, suggests that all SADS-CoV strains originate from a single bat source and that the virus has been spreading in pig farms in several provinces of China for at least seven years since the first outbreak in August 2016. [ABSTRACT FROM AUTHOR]

The algorithms for phylogenetic reconstruction are central to computational molecular evolution. The relentless pace of data acquisition has exposed their poor scalability and the conclusion that the conventional application of these methods is impractical and not justifiable from an energy usage perspective. Furthermore, the drive to improve the statistical performance of phylogenetic methods produces increasingly parameter-rich models of sequence evolution, which worsens the computational performance. Established theoretical and algorithmic results identify supertree methods as critical to divide-and-conquer strategies for improving scalability of phylogenetic reconstruction. Of particular importance is the ability to explicitly accommodate rooted topologies. These can arise from the more biologically plausible non-stationary models of sequence evolution. We make a contribution to addressing this challenge with Spectral Cluster Supertree, a novel supertree method for merging a set of overlapping rooted phylogenetic trees. It offers significant improvements over Min-Cut supertree and previous state-of-the-art methods in terms of both time complexity and overall topological accuracy, particularly for problems of large size. We perform comparisons against Min-Cut supertree and Bad Clade Deletion. Leveraging two tree topology distance metrics, we demonstrate that while Bad Clade Deletion generates more correct clades in its resulting supertree, Spectral Cluster Supertree’s generated tree is generally more topologically close to the true model tree. Over large datasets containing 10,000 taxa and ∼500 source trees, where Bad Clade Deletion usually takes ∼2 h to run, our method generates a supertree in on average 20 s. Spectral Cluster Supertree is released under an open source license and is available on the python package index as sc-supertree.

Understanding the drivers of morphological convergence requires investigation into its relationship with behavior and niche space, and such investigations in turn provide insights into evolutionary dynamics, functional morphology, and life history. Mygalomorph spiders (trapdoor spiders and their kin) have long been associated with high levels of morphological homoplasy, and many convergent features can be intuitively associated with different behavioral niches. Using genus-level phylogenies based on recent genomic studies and a newly assembled matrix of discrete behavioral and somatic morphological characters, we reconstruct the evolution of burrowing behavior in the Mygalomorphae, compare the influence of behavior and evolutionary history on somatic morphology, and test hypotheses of correlated evolution between specific morphological features and behavior. Our results reveal the simplicity of the mygalomorph adaptive landscape, with opportunistic, web-building taxa at one end, and burrowing/nesting taxa with structurally modified burrow entrances (e.g., a trapdoor) at the other. Shifts in behavioral niche, in both directions, are common across the evolutionary history of the Mygalomorphae, and several major clades include taxa inhabiting both behavioral extremes. Somatic morphology is heavily influenced by behavior, with taxa inhabiting the same behavioral niche often more similar morphologically than more closely related but behaviorally divergent taxa, and we were able to identify a suite of 11 somatic features that show significant correlation with particular behaviors. We discuss these findings in light of the function of particular morphological features, niche dynamics within the Mygalomorphae, and constraints on the mygalomorph adaptive landscape relative to other spiders.

Abstract Phylogenetic trees represent the evolutionary relationships and ancestry of various species or groups of organisms. Comparing these trees by measuring the distance between them is essential for applications such as tree clustering and the Tree of Life project. Many distance metrics for phylogenetic trees focus on trees defined on the same set of taxa. However, some problems require calculating distances between trees with different but overlapping sets of taxa. This study reviews state‐of‐the‐art distance measures for such trees, covering six major approaches, including the constraint‐based Robinson–Foulds (RF) distance RF(−), the completion‐based RF(+), the generalized RF (GRF), the dissimilarity measure, the vectorial tree distance, and the geodesic distance in the extended Billera‐Holmes‐Vogtmann tree space. Among these, three RF‐based methods, RF(−), RF(+), and GRF, were examined in detail on generated clusters of phylogenetic trees defined on different but mutually overlapping sets of taxa. Additionally, we reviewed nine related techniques, including leaf imputation methods, the tree edit distance, and visual comparison. A comparison of the related distance measures, highlighting their principal advantages and shortcomings, is provided. This review offers valuable insights into their applicability and performance, guiding the appropriate use of these metrics based on tree type (rooted or unrooted) and information type (topological or branch lengths).

Abstract Background Genome-scale phylogenetic analysis based on core gene sets is routinely used in microbiological research. However, the techniques are still not approachable for individuals with little bioinformatics experience. Here, we present EasyCGTree, a user-friendly and cross-platform pipeline to reconstruct genome-scale maximum-likehood (ML) phylogenetic tree using supermatrix (SM) and supertree (ST) approaches. Results EasyCGTree was implemented in Perl programming languages and was built using a collection of published reputable programs. All the programs were precompiled as standalone executable files and contained in the EasyCGTree package. It can run after installing Perl language environment. Several profile hidden Markov models (HMMs) of core gene sets were prepared in advance to construct a profile HMM database (PHD) that was enclosed in the package and available for homolog searching. Customized gene sets can also be used to build profile HMM and added to the PHD via EasyCGTree. Taking 43 genomes of the genus Paracoccus as the testing data set, consensus (a variant of the typical SM), SM, and ST trees were inferred via EasyCGTree successfully, and the SM trees were compared with those inferred via the pipelines UBCG and bcgTree, using the metrics of cophenetic correlation coefficients (CCC) and Robinson–Foulds distance (topological distance). The results suggested that EasyCGTree can infer SM trees with nearly identical topology (distance 0.99) to those of trees inferred with the two pipelines. Conclusions EasyCGTree is an all-in-one automatic pipeline from input data to phylogenomic tree with guaranteed accuracy, and is much easier to install and use than the reference pipelines. In addition, ST is implemented in EasyCGTree conveniently and can be used to explore prokaryotic evolutionary signals from a different perspective. The EasyCGTree version 4 is freely available for Linux and Windows users at Github ( https://github.com/zdf1987/EasyCGTree4 ).

The Open Tree of Life (OToL) project produces a supertree that summarizes phylogenetic knowledge from tree estimates published in the primary literature. The supertree construction algorithm iteratively calls Aho’s Build algorithm thousands of times in order to assess the compatability of different phylogenetic groupings. We describe an incrementalized version of the Build algorithm that is able to share work between successive calls to Build. We provide details that allow a programmer to implement the incremental algorithm BuildInc, including pseudo-code and a description of data structures. We assess the effect of BuildInc on our supertree algorithm by analyzing simulated data and by analyzing a supertree problem taken from the OpenTree 13.4 synthesis tree. We find that BuildInc provides up to 550-fold speedup for our supertree algorithm.

The extraordinary morphological diversity among extant mammals poses a challenge for studies of speciation, adaptation, molecular evolution, and reproductive isolation. Despite the recent wealth of molecular studies on mammalian phylogenetics, uncertainties remain surrounding both ancestral and more recent divergence events that have proven difficult to resolve. Multi-gene datasets, especially including genes that are highly divergent, often provide increased support for higher-level affinities within Mammalia; however, such analyses require vast amounts of genomic sequence data and at times, intensive, high-performance computational effort. Furthermore, despite the large-scale efforts dedicated to comprehensive, multi-gene phylogenetic analyses using a combination of mitochondrial, nuclear, and other sequences (e.g., tRNA, ultra-conserved elements, and transposable elements), many relationships across Mammalia remain highly controversial. To offer another approach and provide a phylogenetic solution to this longstanding issue, here we present a phylogenetic tool based on a single reproductive molecular marker, zonadhesin (gene: Zan), one of two known mammalian speciation genes, which encodes the rapidly evolving sperm protein zonadhesin that mediates species-specific adhesion to the egg and thereby promotes reproductive isolation among placental mammals (Eutheria). Topological comparison of Zan Maximum Likelihood phylogenies to a nearly complete mammalian supertree confirmed Zan's striking phylogenetic utility and resolution at both deeper and more terminal nodes in the placental mammalian phylogeny. This single gene marker yielded an equivalent and/or superiorly supported topology in comparison to a supertree generated using DNA sequences from a supermatrix of 31 genes from 5911 species (extinct and extant). Resolution achieved with this new phylogenetic approach provides unique insights into the divergence of both early and recent mammalian radiations. Finally, and perhaps most importantly, the utility of zonadhesin as a singular molecular marker was especially useful in clades where sufficient taxon sampling is impossible to achieve, and where only a subset of members of the mammalian species tree is available. The eutherian relationships presented here provide a foundation for future studies in the reconstruction of mammalian classifications, including reproductive isolation, hybridization, and biodiversification of species. [ABSTRACT FROM AUTHOR]

In phylogenomics, incongruences between gene trees, resulting from both artifactual and biological reasons, can decrease the signal-to-noise ratio and complicate species tree inference. The amount of data handled today in classical phylogenomic analyses precludes manual error detection and removal. However, a simple and efficient way to automate the identification of outliers from a collection of gene trees is still missing. Here, we present PhylteR, a method that allows rapid and accurate detection of outlier sequences in phylogenomic datasets, i.e. species from individual gene trees that do not follow the general trend. PhylteR relies on DISTATIS, an extension of multidimensional scaling to 3 dimensions to compare multiple distance matrices at once. In PhylteR, these distance matrices extracted from individual gene phylogenies represent evolutionary distances between species according to each gene. On simulated datasets, we show that PhylteR identifies outliers with more sensitivity and precision than a comparable existing method. We also show that PhylteR is not sensitive to ILS-induced incongruences, which is a desirable feature. On a biological dataset of 14,463 genes for 53 species previously assembled for Carnivora phylogenomics, we show (i) that PhylteR identifies as outliers sequences that can be considered as such by other means, and (ii) that the removal of these sequences improves the concordance between the gene trees and the species tree. Thanks to the generation of numerous graphical outputs, PhylteR also allows for the rapid and easy visual characterization of the dataset at hand, thus aiding in the precise identification of errors. PhylteR is distributed as an R package on CRAN and as containerized versions (docker and singularity). [ABSTRACT FROM AUTHOR]

Background: Genome-scale phylogenetic analysis based on core gene sets is routinely used in microbiological research. However, the techniques are still not approachable for individuals with little bioinformatics experience. Here, we present EasyCGTree, a user-friendly and cross-platform pipeline to reconstruct genome-scale maximum-likehood (ML) phylogenetic tree using supermatrix (SM) and supertree (ST) approaches. Results: EasyCGTree was implemented in Perl programming languages and was built using a collection of published reputable programs. All the programs were precompiled as standalone executable files and contained in the EasyCGTree package. It can run after installing Perl language environment. Several profile hidden Markov models (HMMs) of core gene sets were prepared in advance to construct a profile HMM database (PHD) that was enclosed in the package and available for homolog searching. Customized gene sets can also be used to build profile HMM and added to the PHD via EasyCGTree. Taking 43 genomes of the genus Paracoccus as the testing data set, consensus (a variant of the typical SM), SM, and ST trees were inferred via EasyCGTree successfully, and the SM trees were compared with those inferred via the pipelines UBCG and bcgTree, using the metrics of cophenetic correlation coefficients (CCC) and Robinson–Foulds distance (topological distance). The results suggested that EasyCGTree can infer SM trees with nearly identical topology (distance < 0.1) and accuracy (CCC > 0.99) to those of trees inferred with the two pipelines. Conclusions: EasyCGTree is an all-in-one automatic pipeline from input data to phylogenomic tree with guaranteed accuracy, and is much easier to install and use than the reference pipelines. In addition, ST is implemented in EasyCGTree conveniently and can be used to explore prokaryotic evolutionary signals from a different perspective. The EasyCGTree version 4 is freely available for Linux and Windows users at Github (https://github.com/zdf1987/EasyCGTree4). [ABSTRACT FROM AUTHOR]

Despite the increasingly available phylogenetic hypotheses for multiple taxonomic groups, most of them do not include all species. In phylogenetic ecology, there is still a strong demand to have phylogenies with all species in a study included. The existing software tools to graft species to backbone megatrees, however, are mostly limited to a specific taxonomic group such as plants or fishes. Here, I introduce a new user-friendly R package, 'rtrees', that can assemble phylogenies from existing or user-provided megatrees. For most common taxonomic groups, users can only provide a vector of species scientific names to get a phylogeny or a set of posterior phylogenies from megatrees. It is my hope that 'rtrees' can provide an easy, flexible, and reliable way to assemble phylogenies from megatrees, facilitating the progress of phylogenetic ecology. [ABSTRACT FROM AUTHOR]

The extraordinary morphological diversity among extant mammals poses a challenge for studies of speciation, adaptation, molecular evolution, and reproductive isolation. Despite the recent wealth of molecular studies on mammalian phylogenetics, uncertainties remain surrounding both ancestral and more recent divergence events that have proven difficult to resolve. Multi-gene datasets, especially including genes that are highly divergent, often provide increased support for higher-level affinities within Mammalia; however, such analyses require vast amounts of genomic sequence data and at times, intensive, high-performance computational effort. Furthermore, despite the large-scale efforts dedicated to comprehensive, multi-gene phylogenetic analyses using a combination of mitochondrial, nuclear, and other sequences (e.g., tRNA, ultra-conserved elements, and transposable elements), many relationships across Mammalia remain highly controversial. To offer another approach and provide a phylogenetic solution to this longstanding issue, here we present a phylogenetic tool based on a single reproductive molecular marker, zonadhesin (gene: Zan), one of two known mammalian speciation genes, which encodes the rapidly evolving sperm protein zonadhesin that mediates species-specific adhesion to the egg and thereby promotes reproductive isolation among placental mammals (Eutheria). Topological comparison of Zan Maximum Likelihood phylogenies to a nearly complete mammalian supertree confirmed Zan’s striking phylogenetic utility and resolution at both deeper and more terminal nodes in the placental mammalian phylogeny. This single gene marker yielded an equivalent and/or superiorly supported topology in comparison to a supertree generated using DNA sequences from a supermatrix of 31 genes from 5911 species (extinct and extant). Resolution achieved with this new phylogenetic approach provides unique insights into the divergence of both early and recent mammalian radiations. Finally, and perhaps most importantly, the utility of zonadhesin as a singular molecular marker was especially useful in clades where sufficient taxon sampling is impossible to achieve, and where only a subset of members of the mammalian species tree is available. The eutherian relationships presented here provide a foundation for future studies in the reconstruction of mammalian classifications, including reproductive isolation, hybridization, and biodiversification of species.

Supertree methods are tree reconstruction techniques that combine several smaller gene trees (possibly on different sets of species) to build a larger species tree. The question of interest is whether the reconstructed supertree converges to the true species tree as the number of gene trees increases (that is, the consistency of supertree methods). In this paper, we are particularly interested in the convergence rate of the maximum likelihood supertree. Previous studies on the maximum likelihood supertree approach often formulate the question of interest as a discrete problem and focus on reconstructing the correct topology of the species tree. Aiming to reconstruct both the topology and the branch lengths of the species tree, we propose an analytic approach for analyzing the convergence of the maximum likelihood supertree method. Specifically, we consider each tree as one point of a metric space and prove that the distance between the maximum likelihood supertree and the species tree converges to zero at a polynomial rate under some mild conditions. We further verify these conditions for the popular exponential error model of gene trees.

A clade's evolutionary history is shaped, in part, by geographical range expansion, sweepstakes dispersal and local extinction. A rigorous understanding of historical biogeography may therefore yield insights into macroevolutionary dynamics such as adaptive radiation. Modern historical biogeographic analyses typically fit statistical models to molecular phylogenies, but it remains unclear whether extant species provide sufficient signal or if well-sampled phylogenies of extinct and extant taxa are necessary to produce meaningful estimates of past ranges. We investigated the historical biogeography of Primates and their euarchontan relatives using a novel meta-analytical phylogeny of over 900 extant (n= 419) and extinct (n = 483) species spanning their entire evolutionary history. Ancestral range estimates for young nodes were largely congruent with those derived from molecular phylogeny. However, node age exerts a significant effect on ancestral range estimate congruence, and the probability of congruent inference dropped below 0.5 for nodes older than the late Eocene, corresponding to the origins of higher-level clades. Discordance was not observed in analyses of extinct taxa alone. Fossils are essential for robust ancestral range inference and biogeographic analyses of extant clades originating in the deep past should be viewed with scepticism without them. [ABSTRACT FROM AUTHOR]

Abstract Dothideomycetes is the most diverse fungal class in Ascomycota and includes species with a wide range of lifestyles. Previous multilocus studies have investigated the taxonomic and evolutionary relationships of these taxa but often failed to resolve early diverging nodes and frequently generated inconsistent placements of some clades. Here, we use a phylogenomic approach to resolve relationships in Dothideomycetes, focusing on two genera of melanized, extremotolerant rock-inhabiting fungi, Lichenothelia and Saxomyces, that have been suggested to be early diverging lineages. We assembled phylogenomic datasets from newly sequenced (4) and previously available genomes (238) of 242 taxa. We explored the influence of tree inference methods, supermatrix vs. coalescent-based species tree, and the impact of varying amounts of genomic data. Overall, our phylogenetic reconstructions provide consistent and well-supported topologies for Dothideomycetes, recovering Lichenothelia and Saxomyces among the earliest diverging lineages in the class. In addition, many of the major lineages within Dothideomycetes are recovered as monophyletic, and the phylogenomic approach implemented strongly supports their relationships. Ancestral character state reconstruction suggest that the rock-inhabiting lifestyle is ancestral within the class.

Let α be a real number with 0 ≤ α < 1 , G be a uniform hypergraph, and A α (G) = α D (G) + (1 − α) A (G) , where D (G) and A (G) are the diagonal degree tensor and the adjacency tensor of G , respectively. The spectral radius of A α (G) is called the α -spectral radius of G. In this paper, some properties for the α -spectral radius of connected k -uniform hypergraphs are investigated, the unique k -uniform supertree with the largest α -spectral radius among all k -uniform supertrees with a given degree sequence is characterized, and the majorization theorem for k -uniform supertrees is obtained. By applying the majorization theorem, we determine the k -uniform supertrees obtaining the three largest α -spectral radius among all k -uniform supertrees with n vertices, give a new proof ordering the eight largest spectral radius among all k -uniform supertrees with n vertices, propose an open problem for further research, and characterize the unique k -uniform supertree with the largest α -spectral radius among all k -uniform supertrees with given different parameters, e.g., the maximum degree △ , or the number of pendent vertices. [ABSTRACT FROM AUTHOR]

In this paper we show how the α -spectral radius changes under the edge grafting operations on connected k -uniform hypergraphs. We characterize the extremal hypertree for α -spectral radius among k -uniform non-caterpillar hypergraphs with given order, size and diameter. We also characterize the supertree with the second largest α -spectral radius among all k -uniform supertrees on n vertices. [ABSTRACT FROM AUTHOR]

Collectively, ray-finned fishes (Actinopterygii) display far more diversity in many reproductive and genomic features than any other major vertebrate group. Recent large-scale comparative phylogenetic analyses have begun to reveal the evolutionary patterns and putative causes for much of this diversity. Several such recent studies have offered clues to how different reproductive syndromes evolved in these fishes, as well as possible physiological and genomic triggers. In many cases, repeated independent origins of complex reproductive strategies have been uncovered, probably reflecting convergent selection operating on common suites of underlying genes and hormonal controls. For example, phylogenetic analyses have uncovered multiple origins and predominant transitional pathways in the evolution of alternative male reproductive tactics, modes of parental care and mechanisms of sex determination. They have also shown that sexual selection in these fishes is repeatedly associated with particular reproductive strategies. Collectively, studies on reproductive and genomic diversity across the Actinopterygii illustrate both the strengths and the limitations of comparative phylogenetic approaches on large taxonomic scales. © 2006 The Authors.

The Open Tree of Life (OToL) project produces a supertree that summarizes phylogenetic knowledge from tree estimates published in the primary literature. The supertree construction algorithm iteratively calls Aho's Build algorithm thousands of times in order to assess the compatability of different phylogenetic groupings. We describe an incrementalized version of the Build algorithm that is able to share work between successive calls to Build. We provide details that allow a programmer to implement the incremental algorithm BuildInc, including pseudo-code and a description of data structures. We assess the effect of BuildInc on our supertree algorithm by analyzing simulated data and by analyzing a supertree problem taken from the OpenTree 13.4 synthesis tree. We find that BuildInc provides up to 550-fold speedup for our supertree algorithm., Competing Interests: The authors declare there are no competing interests., (2024 Redelings and Holder.)

Nuclear pore complex (NPC) is the largest multimeric protein assembly of the eukaryotic cell, which mediates the nucleocytoplasmic transport. The constituent proteins of this assembly (nucleoporins) are present in varying copy numbers to give a size from ~ 60 MDa (yeast) to 112 MDa (human) and share common ancestry with other membrane‐associated complexes such as COPI/COPII and thus share the same structural folds. However, the nucleoporins across species exhibit very low percentage sequence similarity and this reflects in their distinct secondary structure and domain organization. We employed thorough sequence and phylogenetic analysis guided from structure‐based alignments of all the nucleoporins from fungi to metazoans to understand the evolution of NPC. Through evolutionary pressure analysis on various nucleoporins, we deduced that these proteins are under differential selection pressure and hence the homologous interacting partners do not complement each other in the in vitro pull‐down assay. The super tree analysis of all nucleoporins taken together illustrates divergent evolution of nucleoporins and notably, the degree of divergence is more apparent in higher order organisms as compared to lower species. Overall, our results support the hypothesis that the protein–protein interactions in such large multimeric assemblies are species specific in nature and hence their structure and function should also be studied in an organism‐specific manner. [ABSTRACT FROM AUTHOR]

Transcriptome-based exon capture methods provide an approach to recover several hundred markers from genomic DNA, allowing for robust phylogenetic estimation at deep timescales. We applied this method to a highly diverse group of venomous marine snails, Conoidea, for which published phylogenetic trees remain mostly unresolved for the deeper nodes. We targeted 850 protein coding genes (678,322 bp) in ca. 120 samples, spanning all (except one) known families of Conoidea and a broad selection of non-Conoidea neogastropods. The capture was successful for most samples, although capture efficiency decreased when DNA libraries were of insufficient quality and/or quantity (dried samples or low starting DNA concentration) and when targeting the most divergent lineages. An average of 75.4% of proteins was recovered, and the resulting tree, reconstructed using both supermatrix (IQ-tree) and supertree (Astral-II, combined with the Weighted Statistical Binning method) approaches, are almost fully supported. A reconstructed fossil-calibrated tree dates the origin of Conoidea to the Lower Cretaceous. We provide descriptions for two new families. The phylogeny revealed in this study provides a robust framework to reinterpret changes in Conoidea anatomy through time. Finally, we used the phylogeny to test the impact of the venom gland and radular type on diversification rates. Our analyses revealed that repeated losses of the venom gland had no effect on diversification rates, while families with a breadth of radula types showed increases in diversification rates, thus suggesting that trophic ecology may have an impact on the evolution of Conoidea. [ABSTRACT FROM AUTHOR]

An understanding of the balance of interspecific competition and the physical environment in structuring organismal communities is crucial because those communities structured primarily by their physical environment typically exhibit greater sensitivity to environmental change than those structured predominantly by competitive interactions. Here, using detailed phylogenetic and functional information, we investigate this question in macrofaunal assemblages from Northwest Atlantic Ocean continental slopes, a high seas region projected to experience substantial environmental change through the current century. We demonstrate assemblages to be both phylogenetically and functionally under-dispersed, and thus conclude that the physical environment, not competition, may dominate in structuring deep-ocean communities. Further, we find temperature and bottom trawling intensity to be among the environmental factors significantly related to assemblage diversity. These results hint that deep-ocean communities are highly sensitive to their physical environment and vulnerable to environmental perturbation, including by direct disturbance through fishing, and indirectly through the changes brought about by climate change. [ABSTRACT FROM AUTHOR]

Supertree methods enable the reconstruction of large phylogenies. The supertree problem can be formalized in different ways in order to cope with contradictory information in the input. Some supertree methods are based on encoding the input trees in a matrix; other methods try to find minimum cuts in some graph. Recently, we introduced Bad Clade Deletion (BCD) supertrees which combines the graph-based computation of minimum cuts with optimizing a global objective function on the matrix representation of the input trees. The BCD supertree method has guaranteed polynomial running time and is very swift in practice. The quality of reconstructed supertrees was superior to matrix representation with parsimony (MRP) and usually on par with SuperFine for simulated data; but particularly for biological data, quality of BCD supertrees could not keep up with SuperFine supertrees. Here, we present a beam search extension for the BCD algorithm that keeps alive a constant number of partial solutions in each top-down iteration phase. The guaranteed worst-case running time of the new algorithm is still polynomial in the size of the input. We present an exact and a randomized subroutine to generate suboptimal partial solutions. Both beam search approaches consistently improve supertree quality on all evaluated datasets when keeping 25 suboptimal solutions alive. Supertree quality of the BCD Beam Search algorithm is on par with MRP and SuperFine even for biological data. This is the best performance of a polynomial-time supertree algorithm reported so far. [ABSTRACT FROM AUTHOR]

A supertree is a connected and acyclic hypergraph. Let S ( m , d , k ) be the set of k -uniform supertrees with m edges and diameter d . In this paper, we determine the supertrees with the first two largest spectral radii among all supertrees in S ( m , d , k ) for 3 ≤ d ≤ m − 1 . [ABSTRACT FROM AUTHOR]

Phylogenetics is an intrinsic part of many analyses in evolutionary biology and ecology, and as the amount of data available for these analyses is increasing rapidly the need for automated pipelines to deal with the data also increases. Phylommand is a package of four programs to create, manipulate, and/or analyze phylogenetic trees or pairwise alignments. It is built to be easily implemented in software workflows, both directly on the command prompt, and executed using scripts. Inputs can be taken from standard input or a file, and the behavior of the programs can be changed through switches. By using standard file formats for phylogenetic analyses, such as newick, nexus, phylip, and fasta, phylommand is widely compatible with other software.

We present a new supertree method that enables rapid estimation of a summary tree on the scale of millions of leaves. This supertree method summarizes a collection of input phylogenies and an input taxonomy. We introduce formal goals and criteria for such a supertree to satisfy in order to transparently and justifiably represent the input trees. In addition to producing a supertree, our method computes annotations that describe which grouping in the input trees support and conflict with each group in the supertree. We compare our supertree construction method to a previously published supertree construction method by assessing their performance on input trees used to construct the Open Tree of Life version 4, and find that our method increases the number of displayed input splits from 35,518 to 39,639 and decreases the number of conflicting input splits from 2,760 to 1,357. The new supertree method also improves on the previous supertree construction method in that it produces no unsupported branches and avoids unnecessary polytomies. This pipeline is currently used by the Open Tree of Life project to produce all of the versions of project’s “synthetic tree” starting at version 5. This software pipeline is called “propinquity”. It relies heavily on “otcetera”—a set of C++ tools to perform most of the steps of the pipeline. All of the components are free software and are available on GitHub.

Building large supertrees involves the collection, storage, and processing of thousands of individual phylogenies to create large phylogenies with thousands to tens of thousands of taxa. Such large phylogenies are useful for macroevolutionary studies, comparative biology and in conservation and biodiversity. No easy to use and fully integrated software package currently exists to carry out this task. Here, we present a new Python-based software package that uses well defined XML schema to manage both data and metadata. It builds on previous versions by 1) including new processing steps, such as Safe Taxonomic Reduction, 2) using a user-friendly GUI that guides the user to complete at least the minimum information required and includes context-sensitive documentation, and 3) a revised storage format that integrates both tree- and meta-data into a single file. These data can then be manipulated according to a well-defined, but flexible, processing pipeline using either the GUI or a command-line based tool. Processing steps include standardising names, deleting or replacing taxa, ensuring adequate taxonomic overlap, ensuring data independence, and safe taxonomic reduction. This software has been successfully used to store and process data consisting of over 1000 trees ready for analyses using standard supertree methods. This software makes large supertree creation a much easier task and provides far greater flexibility for further work.

It has long been appreciated that analyses of genomic data (e.g., whole genome sequencing or sequence capture) have the potential to reveal the tree of life, but it remains challenging to move from sequence data to a clear understanding of evolutionary history, in part due to the computational challenges of phylogenetic estimation using genome-scale data. Supertree methods solve that challenge because they facilitate a divide-and-conquer approach for large-scale phylogeny inference by integrating smaller subtrees in a computationally efficient manner. Here, we combined information from sequence capture and whole-genome phylogenies using supertree methods. However, the available phylogenomic trees had limited overlap so we used taxon-rich (but not phylogenomic) megaphylogenies to weave them together. This allowed us to construct a phylogenomic supertree, with support values, that included 707 bird species (~7% of avian species diversity). We estimated branch lengths using mitochondrial sequence data and we used these branch lengths to estimate divergence times. Our time-calibrated supertree supports radiation of all three major avian clades (Palaeognathae, Galloanseres, and Neoaves) near the Cretaceous-Paleogene (K-Pg) boundary. The approach we used will permit the continued addition of taxa to this supertree as new phylogenomic data are published, and it could be applied to other taxa as well.

In [8] , Hu and Qi studied the normalized Laplace tensors and normalized Laplace spectra of k -uniform hypergraphs. They also mentioned the question about whether or not 2 is also an H-eigenvalue of the normalized Laplace tensor of a k -uniform hypergraph, when 2 is an eigenvalue of the normalized Laplace tensor (in this case, k is necessarily even). In this paper, we use an expression for the normalized Laplace tensor in terms of the tensor product, together with the diagonal similarity of tensors, the Perron–Frobenius Theorem for nonnegative tensors and nonnegative weakly irreducible tensors, and the concept and properties of odd-colorable hypergraphs introduced in [13] , to give a complete answer to this question. We show that: (i). When k ≡ 2 ( mod 4 ) , then the answer to this question is affirmative. (ii). When k ≡ 0 ( mod 4 ) , then the answer to this question is negative, and in this case, we give an infinite family of counterexamples. We also study the signless normalized Laplace spectra and the signless normalized Laplace H-spectra of hypergraphs. We give structural characterizations of the hypergraphs having the same normalized Laplace spectrum and signless normalized Laplace spectrum, or having the same normalized Laplace H-spectrum and signless normalized Laplace H-spectrum, or both. Finally, we determine the first two k -uniform supertrees of order n with the largest Laplace spectral radii, and also determine the unique k -uniform hypertree of order n with the smallest Laplace spectral radii, in the case when k is even. [ABSTRACT FROM AUTHOR]

Supertree methods merge a set of overlapping phylogenetic trees into a supertree containing all taxa of the input trees. The challenge in supertree reconstruction is the way of dealing with conflicting information in the input trees. Many different algorithms for different objective functions have been suggested to resolve these conflicts. In particular, there exist methods based on encoding the source trees in a matrix, where the supertree is constructed applying a local search heuristic to optimize the respective objective function. We present a novel heuristic supertree algorithm called Bad Clade Deletion (BCD) supertrees. It uses minimum cuts to delete a locally minimal number of columns from such a matrix representation so that it is compatible. This is the complement problem to Matrix Representation with Compatibility (Maximum Split Fit). Our algorithm has guaranteed polynomial worst-case running time and performs swiftly in practice. Different from local search heuristics, it guarantees to return the directed perfect phylogeny for the input matrix, corresponding to the parent tree of the input trees, if one exists. Comparing supertrees to model trees for simulated data, BCD shows a better accuracy (F1 score) than the state-of-the-art algorithms SuperFine (up to 3%) and Matrix Representation with Parsimony (up to 7%); at the same time, BCD is up to 7 times faster than SuperFine, and up to 600 times faster than Matrix Representation with Parsimony. Finally, using the BCD supertree as a starting tree for a combined Maximum Likelihood analysis using RAxML, we reach significantly improved accuracy (1% higher F1 score) and running time (1.7-fold speedup). [ABSTRACT FROM AUTHOR]

This paper generalizes the breadth-first-search ordering on trees to k -uniform supertrees. By using 2-switch operation and edge-moving operation on supertrees, we determine the unique k -uniform supertree with the maximum spectral radius among all k -uniform supertrees with a given degree sequence. Moreover, we generalize the majorization theorem on trees to k -uniform supertrees. [ABSTRACT FROM AUTHOR]

Background There is a huge diversity of microbial taxa, the majority of which have yet to be fully characterized or described. Plant, animal and fungal taxa are formally named and described in numerous vehicles. For prokaryotes, by constrast, all new validly described taxa appear in just one repository: the International Journal of Systematics and Evolutionary Microbiology (IJSEM). This is the official journal of record for bacterial names of the International Committee on Systematics of Prokaryotes (ICSP) of the International Union of Microbiological Societies (IUMS). It also covers the systematics of yeasts. This makes IJSEM an excellent candidate against which to test systems for the automated and semi-automated synthesis of published phylogenies. New information In this paper we apply computer vision techniques to automatically convert phylogenetic tree figure images from IJSEM back into re-usable, computable, phylogenetic data in the form of Newick strings and NEXML. Furthermore, we go on to use the extracted phylogenetic data to compute a formal phylogenetic MRP supertree synthesis, and we compare this to previous hypotheses of taxon relationships given by NCBI's standard taxonomy tree. This is the world's first attempt at automated supertree construction using data exclusively extracted by machines from published figure images. Additionally we reflect on how recent changes to UK copyright law have enabled this project to go ahead without requiring permission from copyright holders, and the related challenges and limitations of doing research on copyright-restricted material. [ABSTRACT FROM AUTHOR]

Supertree methods combine a set of phylogenetic trees into a single supertree. Similar to supermatrix methods, these methods provide a way to reconstruct larger parts of the Tree of Life, potentially evading the computational complexity of phylogenetic inference methods such as maximum likelihood. The supertree problem can be formalized in different ways, to cope with contradictory information in the input. Many supertree methods have been developed. Some of them solve NP-hard optimization problems like the well-known Matrix Representation with Parsimony, while others have polynomial worst-case running time but work in a greedy fashion (FlipCut). Both can profit from a set of clades that are already known to be part of the supertree. The Superfine approach shows how the Greedy Strict Consensus Merger (GSCM) can be used as preprocessing to find these clades. We introduce different scoring functions for the GSCM, a randomization, as well as a combination thereof to improve the GSCM to find more clades. This helps, in turn, to improve the resolution of the GSCM supertree. We find this modifications to increase the number of true positive clades by 18% compared to the currently used Overlap scoring.

Philodendron is the second most diverse genus of the Araceae, a tropical monocot family with significant morphological diversity along its wide geographic distribution in the Neotropics. Although evolutionary studies of Philodendron were conducted in recent years, the phylogenetic relationship among its species remains unclear. Additionally, analyses conducted to date suggested the inclusion of all American representatives of a closely-related genus, Homalomena, within the Philodendron clade. A thorough evaluation of the phylogeny and timescale of these lineages is thus necessary to elucidate the tempo and mode of evolution of this large Neotropical genus and to unveil the biogeographic history of Philodendron evolution along the Amazonian and Atlantic rainforests as well as open dry forests of South America. To this end, we have estimated the molecular phylogeny for 68 Philodendron species, which consists of the largest sampling assembled to date aiming the study of the evolutionary affinities. We have also performed ancestral reconstruction of species distribution along biomes. Finally, we contrasted these results with the inferred timescale of Philodendron and Homalomena lineage diversification. Our estimates indicate that American Homalomena is the sister clade to Philodendron. The early diversification of Philodendron took place in the Amazon forest from Early to Middle Miocene, followed by colonization of the Atlantic forest and the savanna-like landscapes, respectively. Based on the age of the last common ancestor of Philodendron, the species of this genus diversified by rapid radiations, leading to its wide extant distribution in the Neotropical region.

The rapid increase of molecular, as well as other types, of available classification data has created the need to combine this data into a unified hypothesis., Supertree methods are essential when amalgamating phylogenetic information from various, possibly conflicting, sources into a single tree. The goal of a supertree algorithm is to satisfy maximally each such source of information in the output tree., Triplets, rooted trees over three leaves, are the minimal piece of such information when dealing with rooted trees. Due to its fundamental role in phylogenetics, extensive effort has been dedicated to several aspects regarding triplets' research., We have devised a new tool, Triplet MaxCut ( TMC), performing various operations in rooted supertree, principally amalgamating rooted trees based on amalgamating rooted triplets. The utility and efficiency of the algorithm is demonstrated by both simulation study and four real data supertree inputs. [ABSTRACT FROM AUTHOR]

A supertree is a connected and acyclic hypergraph. We study some uniform supertrees with larger spectral radii. We first define a new type of edge-moving operation on hypergraphs, and study its applications on the comparison of the spectral radii of hypergraphs. By using this new operation on some supertrees together with the general edge-moving operation introduced by Li, Shao and Qi in 2015, and using a result by Zhou et al. in 2014 about the relation between the spectral radii of an ordinary graph and its power hypergraph, we are able to determine the first eight k -uniform supertrees on n vertices with the largest spectral radii. [ABSTRACT FROM AUTHOR]

Aims The aim of this article is 3-fold. First, we present an updated version of a published megaphylogeny of vascular plants that can be used in studies of plant ecology and biogeography. Second, we develop a tool that can be used by botanists and plant ecologists to generate phylogenetic hypotheses in three scenarios. Third, we use a set of regional assemblages of angiosperm trees in North America as a model system to evaluate the effect of differences in phylogenies generated using the three scenarios on the quantification of phylogenetic properties and the relationship between measures of phylogenetic properties and environment. Methods The taxonomy and nomenclature of plant species in the megaphylogeny were standardized according to The Plant List (version 1.1). A tool for generating phylogenies was created using the R language. The robustness of derived phylogenies was evaluated using correlation and regression analyses. Important Findings An updated megaphylogeny of vascular plants (PhytoPhylo) and a tool for reconstructing phylogenies of seed plants (S.PhyloMaker) were generated. Our study shows that phylogenies generated by S.PhyloMaker using the PhytoPhylo megaphylogeny as a backbone are nearly as good as phylogeny resolved at the species level when using derived phylogenies to quantify phylogenetic properties (e.g. phylogenetic diversity and phylogenetic relatedness) of biological assemblages, and that S.PhyloMaker-generated phylogenies are robust for studies of community ecology and biogeography, particularly those seeking for patterns of phylogenetic properties along environmental gradients. [ABSTRACT FROM AUTHOR]

Background: Branch lengths are an important attribute of phylogenetic trees, providing essential information for many studies in evolutionary biology. Yet, part of the current methodology to reconstruct a phylogeny from genomic information--namely supertree methods--focuses on the topology or structure of the phylogenetic tree, rather than the evolutionary divergences associated to it. Moreover, accurate methods to estimate branch lengths--typically based on probabilistic analysis of a concatenated alignment--are limited by large demands in memory and computing time, and may become impractical when the data sets are too large. Results: Here, we present a novel phylogenomic distance-based method, named ERaBLE (Evolutionary Rates and Branch Length Estimation), to estimate the branch lengths of a given reference topology, and the relative evolutionary rates of the genes employed in the analysis. ERaBLE uses as input data a potentially very large collection of distance matrices, where each matrix is obtained from a different genomic region--either directly from its sequence alignment, or indirectly from a gene tree inferred from the alignment. Our experiments show that ERaBLE is very fast and fairly accurate when compared to other possible approaches for the same tasks. Specifically, it efficiently and accurately deals with large data sets, such as the OrthoMaM v8 database, composed of 6,953 exons from up to 40 mammals. Conclusions: ERaBLE may be used as a complement to supertree methods--or it may provide an efficient alternative to maximum likelihood analysis of concatenated alignments--to estimate branch lengths from phylogenomic data sets. [ABSTRACT FROM AUTHOR]

The utility of the matrix representation with flipping (MRF) supertree method has been limited by the speed of its heuristic algorithms. We describe a new heuristic algorithm for MRF supertree construction that improves upon the speed of the previous heuristic by a factor of n (the number of taxa in the supertree). This new heuristic makes MRF tractable for large-scale supertree analyses and allows the first comparisons of MRF with other supertree methods using large empirical data sets. Analyses of three published supertree data sets with between 267 to 571 taxa indicate that MRF supertrees are equally or more similar to the input trees on average than matrix representation with parsimony (MRP) and modified mincut supertrees. The results also show that large dif ferences may exist between MRF and MRP supertrees and demonstrate that the MRF supertree method is a practical and potentially more accurate alternative to the nearly ubiquitous MRP supertree method.