LATIN 2012: Theoretical Informatics
10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings
Page
%P
11 Result(s)
within
David Fernández-Baca
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
-
Chapter and Conference Paper
Fast Compatibility Testing for Phylogenies with Nested Taxa
Semi-labeled trees are phylogenies whose internal nodes may be labeled by higher-order taxa. Thus, a leaf labeled Mus musculus could nest within a subtree whose root node is labeled Rodentia, which itself could n...
-
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 ...
-
Book and Conference Proceedings
-
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...
-
Chapter and Conference Paper
Fixed-Parameter Algorithms for Finding Agreement Supertrees
We study the agreement supertree approach for combining rooted phylogenetic trees when the input trees do not fully agree on the relative positions of the taxa. Two approaches to dealing with such conflicting ...
-
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 ...
-
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...
-
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...
-
Chapter and Conference Paper
Supertrees by Flip**
The input to a supertree problem is a collection of phyloge-netic trees that intersect pairwise in their leaf sets; the goal is to construct a single tree that retains as much as possible of the information in...
-
Chapter and Conference Paper
Inverse Parametric Sequence Alignment
We consider the inverse parametric sequence alignment problem, where a sequence alignment is given and the task is to determine parameter values such that the given alignment is optimal at that parameter setti...
-
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...
