Sciweavers

92 search results - page 10 / 19
» Optimal sequencing by hybridization in rounds
Sort
View
RECOMB
2002
Springer
14 years 9 months ago
String barcoding: uncovering optimal virus signatures
There are many critical situations when one needs to rapidly identify an unidentified pathogen from among a given set of previously sequenced pathogens. DNA or RNA hybridization c...
Sam Rash, Dan Gusfield
BMCBI
2002
100views more  BMCBI 2002»
13 years 8 months ago
An algorithm and program for finding sequence specific oligo-nucleotide probes for species identification
Background: The identification of species or species groups with specific oligo-nucleotides as molecular signatures is becoming increasingly popular for bacterial samples. However...
Alexander E. Pozhitkov, Diethard Tautz
BMCBI
2010
116views more  BMCBI 2010»
13 years 8 months ago
A hybrid approach to protein folding problem integrating constraint programming with local search
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
Abu Zafer M. Dayem Ullah, Kathleen Steinhöfel
ISIPTA
2003
IEEE
125views Mathematics» more  ISIPTA 2003»
14 years 1 months ago
Game-Theoretic Learning Using the Imprecise Dirichlet Model
We discuss two approaches for choosing a strategy in a two-player game. We suppose that the game is played a large number of rounds, which allows the players to use observations o...
Erik Quaeghebeur, Gert de Cooman
CORR
2004
Springer
103views Education» more  CORR 2004»
13 years 8 months ago
Online convex optimization in the bandit setting: gradient descent without a gradient
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
Abraham Flaxman, Adam Tauman Kalai, H. Brendan McM...