29 search results - page 5 / 6 » Finding a maximum likelihood tree is hard |
RECOMB
2009
Springer
15 years 10 months ago
2009
Springer
Phylogenetic Bootstrapping (BS) is a standard technique for inferring confidence values on phylogenetic trees that is based on reconstructing many trees from minor variations of th...
WWW
2005
ACM
15 years 10 months ago
2005
ACM
We introduce a stricter Web community definition to overcome boundary ambiguity of a Web community defined by Flake, Lawrence and Giles [2], and consider the problem of finding co...
STOC
2003
ACM
15 years 9 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
ALT
2010
Springer
14 years 11 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
103
click to vote
CIKM
2006
Springer
15 years 1 months ago
2006
Springer
It is important yet hard to identify navigational queries in Web search due to a lack of sufficient information in Web queries, which are typically very short. In this paper we st...