Sciweavers

245 search results - page 35 / 49
» Using Finite State Automata for Sequence Mining
Sort
View
NIPS
2001
13 years 9 months ago
The Infinite Hidden Markov Model
We show that it is possible to extend hidden Markov models to have a countably infinite number of hidden states. By using the theory of Dirichlet processes we can implicitly integ...
Matthew J. Beal, Zoubin Ghahramani, Carl Edward Ra...
BMCBI
2010
104views more  BMCBI 2010»
13 years 8 months ago
A method for automatically extracting infectious disease-related primers and probes from the literature
Background: Primer and probe sequences are the main components of nucleic acid-based detection systems. Biologists use primers and probes for different tasks, some related to the ...
Miguel García-Remesal, Alejandro Cuevas, Vi...
DAGSTUHL
2007
13 years 9 months ago
Programming self developing blob machines for spatial computing.
: This is a position paper introducing blob computing: A Blob is a generic primitive used to structure a uniform computing substrate into an easier-to-program parallel virtual mach...
Frédéric Gruau, Christine Eisenbeis
NAR
2011
172views Computer Vision» more  NAR 2011»
12 years 10 months ago
NGSmethDB: a database for next-generation sequencing single-cytosine-resolution DNA methylation data
Next-generation sequencing (NGS) together with bisulphite conversion allows the generation of whole genome methylation maps at single-cytosine resolution. This allows studying the...
Michael Hackenberg, Guillermo Barturen, José...
TSC
2008
140views more  TSC 2008»
13 years 7 months ago
Dynamic Web Service Selection for Reliable Web Service Composition
This paper studies the dynamic Web service selection problem in a failure-prone environment, which aims to determine a subset of Web services to be invoked at runtime so as to succ...
San-Yih Hwang, Ee-Peng Lim, Chien-Hsiang Lee, Chen...