Sciweavers

2455 search results - page 288 / 491
» Computability of Models for Sequence Assembly
Sort
View
ENTCS
2006
125views more  ENTCS 2006»
15 years 6 months ago
Monads and Adjunctions for Global Exceptions
In this paper, we look at two categorical accounts of computational effects (strong monad as a model of the monadic metalanguage, adjunction as a model of call-bypush-value with s...
Paul Blain Levy
147
Voted
BMCBI
2008
79views more  BMCBI 2008»
15 years 6 months ago
A high-throughput pipeline for designing microarray-based pathogen diagnostic assays
Background: We present a methodology for high-throughput design of oligonucleotide fingerprints for microarray-based pathogen diagnostic assays. The oligonucleotide fingerprints, ...
Ravi Vijaya Satya, Nela Zavaljevski, Kamal Kumar, ...
ALMOB
2006
138views more  ALMOB 2006»
15 years 6 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh
BMCBI
2005
201views more  BMCBI 2005»
15 years 6 months ago
Principal component analysis for predicting transcription-factor binding motifs from array-derived data
Background: The responses to interleukin 1 (IL-1) in human chondrocytes constitute a complex regulatory mechanism, where multiple transcription factors interact combinatorially to...
Yunlong Liu, Matthew P. Vincenti, Hiroki Yokota
CVPR
2011
IEEE
15 years 2 months ago
Learning Message-Passing Inference Machines for Structured Prediction
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models prov...
Stephane Ross, Daniel Munoz, J. Andrew Bagnell