Sciweavers

10602 search results - page 2100 / 2121
» Weakly Useful Sequences
Sort
View
BMCBI
2007
124views more  BMCBI 2007»
14 years 12 months ago
BranchClust: a phylogenetic algorithm for selecting gene families
Background: Automated methods for assembling families of orthologous genes include those based on sequence similarity scores and those based on phylogenetic approaches. The first ...
Maria S. Poptsova, J. Peter Gogarten
BMCBI
2007
98views more  BMCBI 2007»
14 years 12 months ago
Duration learning for analysis of nanopore ionic current blockades
Background: Ionic current blockade signal processing, for use in nanopore detection, offers a promising new way to analyze single molecule properties, with potential implications ...
Alexander G. Churbanov, Carl Baribault, Stephen Wi...
FUIN
2006
98views more  FUIN 2006»
14 years 12 months ago
On-line Approximate String Matching in Natural Language
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
Kimmo Fredriksson
JAIR
2008
148views more  JAIR 2008»
14 years 12 months ago
Learning Partially Observable Deterministic Action Models
We present exact algorithms for identifying deterministic-actions' effects and preconditions in dynamic partially observable domains. They apply when one does not know the ac...
Eyal Amir, Allen Chang
CORR
2007
Springer
106views Education» more  CORR 2007»
14 years 12 months ago
Bandit Algorithms for Tree Search
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
Pierre-Arnaud Coquelin, Rémi Munos
« Prev « First page 2100 / 2121 Last » Next »