Search

A long-standing hypothesis in evolutionary biology is that the evolution of resource specialization can lead to an evolutionary dead end, where specialists have low diversification rates and limited ability to evolve into generalists. In recent years, advances in comparative methods investigating trait-based differences associated with diversification have enabled more robust tests of this idea and have found mixed support. We test the evolutionary dead end hypothesis by estimating net diversification rate differences associated with nest-type specialization among 3224 species of passerine birds. In particular, we test whether the adoption of hole-nesting, a nest-type specialization that decreases predation, results in reduced diversification rates relative to nesting outside of holes. Further, we examine whether evolutionary transitions to the specialist hole-nesting state have been more frequent than transitions out of hole-nesting. Using diversification models that accounted for background rate heterogeneity and different extinction rate scenarios, we found that hole-nesting specialization was not associated with diversification rate differences. Furthermore, contrary to the assumption that specialists rarely evolve into generalists, we found that transitions out of hole-nesting occur more frequently than transitions into hole-nesting. These results suggest that interspecific competition may limit adoption of hole-nesting, but that such competition does not result in limited diversification of hole-nesters. In conjunction with other recent studies using robust comparative methods, our results add to growing evidence that evolutionary dead ends are not a typical outcome of resource specialization. [Cavity nesting; diversification; hidden-state models; passerines; resource specialization.] [ABSTRACT FROM AUTHOR]

Like many fern lineages comprising reticulate species complexes, Polypodium s.s. (Polypodiacaeae) has a history shaped by rapid diversification, hybridization, and polyploidy that poses substantial challenges for phylogenetic inference with plastid and single-locus nuclear markers. Using target capture probes for 408 nuclear loci developed by the GoFlag project and a custom bioinformatic pipeline, SORTER, we constructed multi-locus nuclear datasets for diploid temperate and Mesoamerican species of Polypodium and five allotetraploid species belonging to the well-studied Polypodium vulgare complex. SORTER employs a clustering approach to separate putatively paralogous copies of targeted loci into orthologous matrices and haplotype phasing to infer allopolyploid haplotypes across loci, resulting in datasets amenable to both concatenated maximum likelihood and multi-species coalescent phylogenetic analyses. By comparing phylogenies derived from maximum likelihood and multi-species coalescent analyses of unphased and phased datasets, as well as evaluating discordance among gene trees and species trees, we recover support for incomplete lineage sorting within Polypodium s.s., novel relationships among diploid taxa of the Polypodium vulgare complex and its Mesoamerican sister clade, and the placement of several Polypodium species within other genera. Additionally, we were able to infer well-supported phylogenies that identified the hypothesized progenitors of the allotetraploid species, indicating that SORTER is an effective and accurate tool for reconstructing homeolog haplotypes of allopolyploids in fern taxa and other non-model organisms from target capture data. [ABSTRACT FROM AUTHOR]

The Indo-Pacific legume genus Serianthes was recently placed in the Archidendron clade (sensu Koenen et al. 2020), a subclade of the mimosoid clade in subfamily Caesalpinioideae, which also includes Acacia, Archidendron, Archidendropsis, Falcataria, Pararchidendron, Paraserianthes and Wallaceodendron. Serianthes comprises ca. 18 species, five subspecies and two varieties that are characterised by bipinnately compound leaves with alternate sessile leaflets, branched axillary corymbiform panicles and woody indehiscent pods. Generic relationships, as well as species relationships within genera in the Archidendron clade, remain uncertain. While the sister relationship between Serianthes and the genus Falcataria is strongly supported by molecular data, the distinction between Serianthes and the monotypic genus Wallaceodendron has been questioned, based on their similar flower and fruit morphologies. We combined three gene-enriched hybrid capture DNA sequence datasets (generated from the 964 mimobaits v1 probe set, the expanded 997 mimobaits v2 probe set and the GoFlag angiosperm 408 probe set) and used their overlapping markers (77 loci of the target exonic and flanking regions) to test the monophyly of Serianthes and to investigate generic relationships within the Archidendron clade using 55 ingoid plus two outgroup taxa. We show that Serianthes is monophyletic, confirm the Serianthes + Falcataria sister relationship to Wallaceodendron and recognise this combined clade as the Serianthes clade within the Archidendron clade. We also evaluated the use of overlapping loci across datasets in combination with concordance analyses to test generic relationships and further investigate previously unresolved relationships across the wider ingoid clade. Concordance analysis revealed limited gene tree conflicts near the tips of the Archidendron clade, but increased discordance at the base of the clade, which could be attributed to rapid lineage divergence (radiation) and/or incomplete lineage sorting. [ABSTRACT FROM AUTHOR]

Abstract Background Gene tree - species tree reconciliation problems infer the patterns and processes of gene evolution within a species tree. Gene tree parsimony approaches seek the evolutionary scenario that implies the fewest gene duplications, duplications and losses, or deep coalescence (incomplete lineage sorting) events needed to reconcile a gene tree and a species tree. While a gene tree parsimony approach can be informative about genome evolution and phylogenetics, error in gene trees can profoundly bias the results. Results We introduce efficient algorithms that rapidly search local Subtree Prune and Regraft (SPR) or Tree Bisection and Reconnection (TBR) neighborhoods of a given gene tree to identify a topology that implies the fewest duplications, duplication and losses, or deep coalescence events. These algorithms improve on the current solutions by a factor of n for searching SPR neighborhoods and n2 for searching TBR neighborhoods, where n is the number of taxa in the given gene tree. They provide a fast error correction protocol for ameliorating the effects of gene tree error by allowing small rearrangements in the topology to improve the reconciliation cost. We also demonstrate a simple protocol to use the gene rearrangement algorithm to improve gene tree parsimony phylogenetic analyses. Conclusions The new gene tree rearrangement algorithms provide a fast method to address gene tree error. They do not make assumptions about the underlying processes of genome evolution, and they are amenable to analyses of large-scale genomic data sets. These algorithms are also easily incorporated into gene tree parsimony phylogenetic analyses, potentially producing more credible estimates of reconciliation cost.

Abstract Background Genomic data provide a wealth of new information for phylogenetic analysis. Yet making use of this data requires phylogenetic methods that can efficiently analyze extremely large data sets and account for processes of gene evolution, such as gene duplication and loss, incomplete lineage sorting (deep coalescence), or horizontal gene transfer, that cause incongruence among gene trees. One such approach is gene tree parsimony, which, given a set of gene trees, seeks a species tree that requires the smallest number of evolutionary events to explain the incongruence of the gene trees. However, the only existing algorithms for gene tree parsimony under the duplication-loss or deep coalescence reconciliation cost are prohibitively slow for large datasets. Results We describe novel algorithms for SPR and TBR based local search heuristics under the duplication-loss cost, and we show how they can be adapted for the deep coalescence cost. These algorithms improve upon the best existing algorithms for these problems by a factor of n, where n is the number of species in the collection of gene trees. We implemented our new SPR based local search algorithm for the duplication-loss cost and demonstrate the tremendous improvement in runtime and scalability it provides compared to existing implementations. We also evaluate the performance of our algorithm on three large-scale genomic data sets. Conclusion Our new algorithms enable, for the first time, gene tree parsimony analyses of thousands of genes from hundreds of taxa using the duplication-loss and deep coalescence reconciliation costs. Thus, this work expands both the size of data sets and the range of evolutionary models that can be incorporated into genome-scale phylogenetic analyses.

Abstract Background There is much interest in developing fast and accurate supertree methods to infer the tree of life. Supertree methods combine smaller input trees with overlapping sets of taxa to make a comprehensive phylogenetic tree that contains all of the taxa in the input trees. The intrinsically hard triplet supertree problem takes a collection of input species trees and seeks a species tree (supertree) that maximizes the number of triplet subtrees that it shares with the input trees. However, the utility of this supertree problem has been limited by a lack of efficient and effective heuristics. Results We introduce fast hill-climbing heuristics for the triplet supertree problem that perform a step-wise search of the tree space, where each step is guided by an exact solution to an instance of a local search problem. To realize time efficient heuristics we designed the first nontrivial algorithms for two standard search problems, which greatly improve on the time complexity to the best known (naïve) solutions by a factor of n and n2 (the number of taxa in the supertree). These algorithms enable large-scale supertree analyses based on the triplet supertree problem that were previously not possible. We implemented hill-climbing heuristics that are based on our new algorithms, and in analyses of two published supertree data sets, we demonstrate that our new heuristics outperform other standard supertree methods in maximizing the number of triplets shared with the input trees. Conclusion With our new heuristics, the triplet supertree problem is now computationally more tractable for large-scale supertree analyses, and it provides a potentially more accurate alternative to existing supertree methods.

Learned traits are thought to be subject to different evolutionary dynamics than other phenotypes, but their evolutionary tempo and mode has received little attention. Learned bird song has been thought to be subject to rapid and constant evolution. However, we know little about the evolutionary modes of learned song divergence over long timescales. Here, we provide evidence that aspects of the territorial songs of Eastern Afromontane sky island sunbirds Cinnyris evolve in a punctuated fashion, with periods of stasis of the order of hundreds of thousands of years or more, broken up by evolutionary pulses. Stasis in learned songs is inconsistent with learned traits being subject to constant or frequent change, as would be expected if selection does not constrain song phenotypes over evolutionary timescales. Learned song may instead follow a process resembling peak shifts on adaptive landscapes. While much research has focused on the potential for rapid evolution in bird song, our results suggest that selection can tightly constrain the evolution of learned songs over long timescales. More broadly, these results demonstrate that some aspects of highly variable, plastic traits can exhibit punctuated evolution, with stasis over long time periods. [ABSTRACT FROM AUTHOR]