Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Testing the Agreement of Trees with Internal Labels

    The input to the agreement problem is a collection \(\mathcal {P}= \{\mathcal {T}_1, \mathcal {T}_2, \dots , \mathcal {T}_k\}\) of phylogenetic trees, called input trees, over partially overlap** sets of taxa...

    David Fernández-Baca, Lei Liu in Bioinformatics Research and Applications (2020)

  2. No Access

    Chapter and Conference Paper

    Checking Phylogenetic Decisiveness in Theory and in Practice

    Suppose we have a set X consisting of n taxa and we are given information from k loci from which to construct a phylogeny for X. Each locus offers information for only a fraction of the taxa. The question is whet...

    Ghazaleh Parvini, Katherine Braught in Bioinformatics Research and Applications (2020)

  3. No Access

    Chapter and Conference Paper

    Constructing Majority-Rule Supertrees

    Supertree methods combine the phylogenetic information from multiple partially-overlap** trees into a larger phylogenetic tree called a supertree. Several supertree construction methods have been proposed to...

    Jianrong Dong, David Fernández-Baca, F. R. McMorris in Algorithms in Bioinformatics (2009)

  4. No Access

    Chapter and Conference Paper

    Generalized Binary Tanglegrams: Algorithms and Applications

    Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and species trees or when studyi...

    Mukul S. Bansal, Wen-Chieh Chang in Bioinformatics and Computational Biology (2009)