104 search results - page 18 / 21 » A Greedy Algorithm Estimating the Height of Random Trees |
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
RECOMB
2004
Springer
14 years 7 months ago
2004
Springer
This paper is concerned with the reconstruction of perfect phylogenies from binary character data with missing values, and related problems of inferring complete haplotypes from h...
ISD
1999
Springer
13 years 11 months ago
1999
Springer
This paper describes an ongoing collaborative research program between the Computer Science and the Forestry and Wildlife Management Departments at the University of Massachusetts...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Point estimates of the parameters in real world models convey valuable information about the actual system. However, parameter comparisons and/or statistical inference requires de...
JCB
1998
13 years 7 months ago
1998
Abstract. The method of invariants is an approach to the problem of reconstructing the phylogenetic tree of a collection of m taxa using nucleotide sequence data. Models for the re...