Sciweavers

829 search results - page 66 / 166
» Bandit Algorithms for Tree Search
Sort
View
ACG
2003
Springer
15 years 3 months ago
Search versus Knowledge: An Empirical Study of Minimax on KRK
This article presents the results of an empirical experiment designed to gain insight into what is the effect of the minimax algorithm on the evaluation function. The experiment’...
Aleksander Sadikov, Ivan Bratko, Igor Kononenko
BMCBI
2010
118views more  BMCBI 2010»
14 years 10 months ago
Detecting lateral gene transfers by statistical reconciliation of phylogenetic forests
Background: To understand the evolutionary role of Lateral Gene Transfer (LGT), accurate methods are needed to identify transferred genes and infer their timing of acquisition. Ph...
Sophie S. Abby, Eric Tannier, Manolo Gouy, Vincent...
BIBM
2009
IEEE
113views Bioinformatics» more  BIBM 2009»
15 years 1 months ago
Fast Motif Selection for Biological Sequences
—We consider the problem of identifying motifs, recurring or conserved patterns, in the sets of biological sequences. To solve this task, we present new deterministic and exact a...
Pavel P. Kuksa, Vladimir Pavlovic
BMCBI
2006
95views more  BMCBI 2006»
14 years 9 months ago
A quantitative analysis of secondary RNA structure using domination based parameters on trees
Background: It has become increasingly apparent that a comprehensive database of RNA motifs is essential in order to achieve new goals in genomic and proteomic research. Secondary...
Teresa W. Haynes, Debra J. Knisley, Edith Seier, Y...
CSB
2004
IEEE
126views Bioinformatics» more  CSB 2004»
15 years 1 months ago
Boosted PRIM with Application to Searching for Oncogenic Pathway of Lung Cancer
Boosted PRIM (Patient Rule Induction Method) is a new algorithm developed for two-class classification problems. PRIM is a variation of those Tree-Based methods ( [4] Ch9.3), seek...
Pei Wang, Young Kim, Jonathan R. Pollack, Robert T...