462 search results - page 51 / 93 » Covering a Tree by a Forest |
FUN
2010
Springer
15 years 1 months ago
2010
Springer
We introduce a new number system that supports increments with a constant number of digit changes. We also give a simple method that extends any number system supporting increments...
COLING
1999
14 years 9 months ago
1999
languages into a general system for describing parsers. Eachparser performs abstract computations using theoperations ofasemiring. Thesystem allows asingle, simple representation t...
RECOMB
2010
Springer
14 years 8 months ago
2010
Springer
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...
SPAA
1993
ACM
15 years 1 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
JACM
2006
14 years 9 months ago
2006
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...