Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Characterizing Compatibility and Agreement of Unrooted Trees via Cuts in Graphs

    Deciding whether there is a single tree —a supertree— that summarizes the evolutionary information in a collection of unrooted trees is a fundamental problem in phylogenetics. We consider two versions of this ...

    Sudheer Vakati, David Fernández-Baca in Algorithms in Bioinformatics (2013)

  2. No Access

    Book and Conference Proceedings

    LATIN 2012: Theoretical Informatics

    10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings

    David Fernández-Baca in Lecture Notes in Computer Science (2012)

  3. No Access

    Chapter and Conference Paper

    Improved Lower Bounds on the Compatibility of Quartets, Triplets, and Multi-state Characters

    We study a long standing conjecture on the necessary and sufficient conditions for the compatibility of multi-state characters: There exists a function f(r) such that, for any set C of r-state characters, C is co...

    Brad Shutters, Sudheer Vakati, David Fernández-Baca in Algorithms in Bioinformatics (2012)

  4. No Access

    Chapter and Conference Paper

    Extracting Conflict-Free Information from Multi-labeled Trees

    A multi-labeled tree, or MUL-tree, is a phylogenetic tree where two or more leaves share a label, e.g., a species name. A MUL-tree can imply multiple conflicting phylogenetic relationships for the same set of ...

    Akshay Deepak, David Fernández-Baca, Michelle M. McMahon in Algorithms in Bioinformatics (2012)

  5. No Access

    Chapter and Conference Paper

    Constructing Large Conservative Supertrees

    Generalizations of the strict and loose consensus methods to the supertree setting, recently introduced by McMorris and Wilkinson, are studied. The supertrees these methods produce are conservative in the sens...

    Jianrong Dong, David Fernández-Baca in Algorithms in Bioinformatics (2011)

  6. No Access

    Chapter and Conference Paper

    Comparing and Aggregating Partially Resolved Trees

    We define, analyze, and give efficient algorithms for two kinds of distance measures for rooted and unrooted phylogenies. For rooted trees, our measures are based on the topologies the input trees induce on tripl...

    Mukul S. Bansal, Jianrong Dong, David Fernández-Baca in LATIN 2008: Theoretical Informatics (2008)

  7. No Access

    Chapter and Conference Paper

    Multi-parameter Minimum Spanning Trees

    A framework for solving certain multidimensional parametric search problems in randomized linear time is presented, along with its application to optimization on matroids, including parametric minimum spanning...

    David Fernández-Baca in LATIN 2000: Theoretical Informatics (2000)