1060 search results - page 205 / 212 » On the Discovery of Random Trees |
RECOMB
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper, we focus on finding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We define a generalization of th...
WSDM
2009
ACM
15 years 4 months ago
2009
ACM
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
BIBM
2007
IEEE
15 years 4 months ago
2007
IEEE
In this paper, we present an algorithm to simultaneously align three biological sequences with affine gap model and infer their common ancestral sequence. Our algorithm can be fu...