3 search results - page 1 / 1 » Finding Smallest Supertrees Under Minor Containment |
WG
1999
Springer
13 years 8 months ago
1999
Springer
The diversity of application areas relying on tree-structured data results in wide interest in algorithms which determine differences or similarities among trees. One way of meas...
DAM
2010
13 years 4 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
SODA
1992
ACM
13 years 5 months ago
1992
ACM
We present several applications in computational geometry of Megiddo's parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance ...