Skip to main content

3 Result(s)

within David Fernández-Baca Remove this filter Data Mining and Knowledge Discovery Remove this filter Discrete Mathematics in Computer Science Remove this filter

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

    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)

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