Sciweavers

2607 search results - page 506 / 522
» Complete Functional Synthesis
Sort
View
BMCBI
2007
120views more  BMCBI 2007»
13 years 9 months ago
Non-coding sequence retrieval system for comparative genomic analysis of gene regulatory elements
Background: Completion of the human genome sequence along with other species allows for greater understanding of the biochemical mechanisms and processes that govern healthy as we...
Sung Tae Doh, Yunyu Zhang, Matthew H. Temple, Li C...
EOR
2006
107views more  EOR 2006»
13 years 9 months ago
Longest path analysis in networks of queues: Dynamic scheduling problems
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...
BMCBI
2007
78views more  BMCBI 2007»
13 years 9 months ago
Improved human disease candidate gene prioritization using mouse phenotype
Background: The majority of common diseases are multi-factorial and modified by genetically and mechanistically complex polygenic interactions and environmental factors. High-thro...
Jing Chen, Huan Xu, Bruce J. Aronow, Anil G. Jegga
BMCBI
2007
148views more  BMCBI 2007»
13 years 9 months ago
WeederH: an algorithm for finding conserved regulatory motifs and regions in homologous sequences
Background: This work addresses the problem of detecting conserved transcription factor binding sites and in general regulatory regions through the analysis of sequences from homo...
Giulio Pavesi, Federico Zambelli, Graziano Pesole
CC
2007
Springer
121views System Software» more  CC 2007»
13 years 9 months ago
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma