Sciweavers

2877 search results - page 269 / 576
» Biological Computing
Sort
View
RECOMB
2004
Springer
16 years 7 months ago
Learning Regulatory Network Models that Represent Regulator States and Roles
Abstract. We present an approach to inferring probabilistic models of generegulatory networks that is intended to provide a more mechanistic representation of transcriptional regul...
Keith Noto, Mark Craven
RECOMB
2001
Springer
16 years 7 months ago
Algorithms for phylogenetic footprinting
Phylogenetic footprinting is a comparative genomics approach for predicting transcription factor binding sites, where a set of orthologous regulatory regions are compared and short...
Mathieu Blanchette
167
Voted
RECOMB
2000
Springer
15 years 10 months ago
Sequencing-by-hybridization at the information-theory bound: an optimal algorithm
In a recent paper (Preparata et al., 1999) we introduced a novel probing scheme for DNA sequencing by hybridization (SBH). The new gapped-probe scheme combines natural and univers...
Franco P. Preparata, Eli Upfal
ASM
2010
ASM
15 years 10 months ago
Starting B Specifications from Use Cases
The B method is one of the most used formal methods, when reactive systems is under question, due to good support for refinement. However, obtaining the formal model from requireme...
Thiago C. de Sousa, Aryldo G. Russo
ISMB
1997
15 years 8 months ago
Hierarchical Protein Structure Superposition Using Both Secondary Structure and Atomic Representations
The structural comparison of proteins has become increasingly important as a means to identify protein motifs and fold families. In this paper we present a new algorithm for the c...
Amit Pal Singh, Douglas L. Brutlag