Skip to main content

previous disabled Page of 2
and
  1. Article

    Open Access

    Whole genome phylogeny of Gallus: introgression and data-type effects

    Previous phylogenetic studies that include the four recognized species of Gallus have resulted in a number of distinct topologies, with little agreement. Several factors could lead to the failure to converge on a...

    George P. Tiley, Akanksha Pandey, Rebecca T. Kimball, Edward L. Braun in Avian Research (2020)

  2. No Access

    Article

    Tempo and timing of ecological trait divergence in bird speciation

    Organismal traits may evolve either gradually or in rapid pulses, but the relative importance of these modes in the generation of species differences is unclear. Additionally, while pulsed evolution is frequen...

    Jay P. McEntee, Joseph A. Tobias, Catherine Sheard in Nature Ecology & Evolution (2018)

  3. Article

    Open Access

    Erratum to: The relationship of recombination rate, genome structure, and patterns of molecular evolution across angiosperms

    George P. Tiley, J. Gordon Burleigh in BMC Evolutionary Biology (2015)

  4. Article

    Open Access

    The relationship of recombination rate, genome structure, and patterns of molecular evolution across angiosperms

    Although homologous recombination affects the efficacy of selection in populations, the pattern of recombination rate evolution and its effects on genome evolution across plants are largely unknown. Recombinat...

    George P. Tiley, J. Gordon Burleigh in BMC Evolutionary Biology (2015)

  5. No Access

    Chapter and Conference Paper

    Constructing and Employing Tree Alignment Graphs for Phylogenetic Synthesis

    Tree alignment graphs (TAGs) provide an intuitive data structure for storing phylogenetic trees that exhibits the relationships of the individual input trees and can potentially account for nested taxonomic re...

    Ruchi Chaudhary, David Fernández-Baca in Algorithms for Computational Biology (2015)

  6. Article

    Open Access

    Data access for the 1,000 Plants (1KP) project

    The 1,000 plants (1KP) project is an international multi-disciplinary consortium that has generated transcriptome data from over 1,000 plant species, with exemplars for all of the major lineages across the Viridi...

    Naim Matasci, Ling-Hong Hung, Zhixiang Yan, Eric J Carpenter in GigaScience (2014)

  7. No Access

    Article

    Scombroid Fishes Provide Novel Insights into the Trait/Rate Associations of Molecular Evolution

    The study of which life history traits primarily affect molecular evolutionary rates is often confounded by the covariance of these traits. Scombroid fishes (billfishes, tunas, barracudas, and their relatives)...

    Fan Qiu, Andrew Kitchen, J. Gordon Burleigh in Journal of Molecular Evolution (2014)

  8. Article

    Open Access

    From algae to angiosperms–inferring the phylogeny of green plants (Viridiplantae) from 360 plastid genomes

    Next-generation sequencing has provided a wealth of plastid genome sequence data from an increasingly diverse set of green plants (Viridiplantae). Although these data have helped resolve the phylogeny of numerous...

    Brad R Ruhfel, Matthew A Gitzendanner, Pamela S Soltis in BMC Evolutionary Biology (2014)

  9. Article

    Open Access

    A scalable method for identifying frequent subtrees in sets of large phylogenetic trees

    We consider the problem of finding the maximum frequent agreement subtrees (MFASTs) in a collection of phylogenetic trees. Existing methods for this problem often do not scale beyond datasets with around 100 t...

    Avinash Ramu, Tamer Kahveci, J Gordon Burleigh in BMC Bioinformatics (2012)

  10. Article

    Open Access

    Efficient error correction algorithms for gene tree reconciliation based on duplication, duplication and loss, and deep coalescence

    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 ...

    Ruchi Chaudhary, J Gordon Burleigh, Oliver Eulenstein in BMC Bioinformatics (2012)

  11. Article

    Open Access

    Consensus properties for the deep coalescence problem and their application for scalable tree search

    To infer a species phylogeny from unlinked genes, phylogenetic inference methods must confront the biological processes that create incongruence between gene trees and the species phylogeny. Intra-specific gen...

    Harris T Lin, J Gordon Burleigh, Oliver Eulenstein in BMC Bioinformatics (2012)

  12. No Access

    Chapter and Conference Paper

    GTP Supertrees from Unrooted Gene Trees: Linear Time Algorithms for NNI Based Local Searches

    Gene tree parsimony (GTP) problems infer species supertrees from a collection of rooted gene trees that are confounded by evolutionary events like gene duplication, gene duplication and loss, and deep coalesce...

    Paweł Górecki, J. Gordon Burleigh in Bioinformatics Research and Applications (2012)

  13. No Access

    Chapter

    Variation in Rates of Molecular Evolution in Plants and Implications for Estimating Divergence Times

    For nearly as long as molecular sequence data have been available for plants, they have been used to construct phylogenetic hypotheses and date the origin and diversification of clades (e.g., Boulter et al. 19...

    J. Gordon Burleigh in Plant Genome Diversity Volume 1 (2012)

  14. No Access

    Chapter

    Identifying the Phylogenetic Context of Whole-Genome Duplications in Plants

    Although evolutionary biologists have long recognized the transformative evolutionary potential of whole-genome duplications (WGDs) in plants, identifying the precise phylogenetic location of WGDs presents man...

    J. Gordon Burleigh in Polyploidy and Genome Evolution (2012)

  15. No Access

    Chapter and Conference Paper

    Algorithms for Knowledge-Enhanced Supertrees

    Supertree algorithms combine smaller phylogenetic trees into a single, comprehensive phylogeny, or supertree. Most supertree problems are NP-hard, and often heuristics identify supertrees with anomalous or unw...

    André Wehe, J. Gordon Burleigh in Bioinformatics Research and Applications (2012)

  16. No Access

    Chapter and Conference Paper

    Fast Local Search for Unrooted Robinson-Foulds Supertrees

    A Robinson-Foulds (RF) supertree for a collection of input trees is a comprehensive species phylogeny that is at minimum total RF distance to the input trees. Thus, an RF supertree is consistent with the maxim...

    Ruchi Chaudhary, J. Gordon Burleigh in Bioinformatics Research and Applications (2011)

  17. No Access

    Chapter and Conference Paper

    The Deep Coalescence Consensus Tree Problem is Pareto on Clusters

    Phylogenetic methods must account for the biological processes that create incongruence between gene trees and the species phylogeny. Deep coalescence, or incomplete lineage sorting creates discord among gene ...

    Harris T. Lin, J. Gordon Burleigh in Bioinformatics Research and Applications (2011)

  18. No Access

    Chapter and Conference Paper

    Algorithms for Rapid Error Correction for the Gene Duplication Problem

    Gene tree - species tree reconciliation problems infer the patterns and processes of gene evolution within the context of an organismal phylogeny. In one example, the gene duplication problem seeks the evoluti...

    Ruchi Chaudhary, J. Gordon Burleigh in Bioinformatics Research and Applications (2011)

  19. Article

    Open Access

    Robinson-Foulds Supertrees

    Supertree methods synthesize collections of small phylogenetic trees with incomplete taxon overlap into comprehensive trees, or supertrees, that include all taxa found in the input trees. Supertree methods bas...

    Mukul S Bansal, J Gordon Burleigh, Oliver Eulenstein in Algorithms for Molecular Biology (2010)

  20. Article

    Open Access

    Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models

    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 proc...

    Mukul S Bansal, J Gordon Burleigh, Oliver Eulenstein in BMC Bioinformatics (2010)

previous disabled Page of 2