4332 search results - page 801 / 867 » A Probabilistic Identification Result |
SODA
2004
ACM
14 years 11 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
CLEF
2009
Springer
14 years 11 months ago
2009
Springer
In this paper we will briefly describe the approaches taken by the Cheshire (Berkeley) Group for the CLEF Adhoc-TEL 2009 tasks (Mono and Bilingual retrieval). Recognizing that man...
BMCBI
2007
14 years 10 months ago
2007
Background: Remote homology detection is a challenging problem in Bioinformatics. Arguably, profile Hidden Markov Models (pHMMs) are one of the most successful approaches in addre...
100
click to vote
BMCBI
2007
14 years 10 months ago
2007
Background: Answers to several fundamental questions in statistical genetics would ideally require knowledge of the ancestral pedigree and of the gene flow therein. A few examples...
BMCBI
2008
14 years 10 months ago
2008
Background: The reconstruction of genetic regulatory networks from microarray gene expression data has been a challenging task in bioinformatics. Various approaches to this proble...