Sciweavers

1007 search results - page 120 / 202
» The Complexity of Futile Questioning
Sort
View
109
Voted
MST
2006
149views more  MST 2006»
15 years 22 days ago
Parameterized Intractability of Distinguishing Substring Selection
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
Jens Gramm, Jiong Guo, Rolf Niedermeier
BMCBI
2005
122views more  BMCBI 2005»
15 years 20 days ago
FACT - a framework for the functional interpretation of high-throughput experiments
Background: Interpreting the results of high-throughput experiments, such as those obtained from DNA-microarrays, is an often time-consuming task due to the high number of data-po...
Felix Kokocinski, Nicolas Delhomme, Gunnar Wrobel,...
122
Voted
JACM
2010
120views more  JACM 2010»
14 years 7 months ago
The structure of inverses in schema mappings
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
Ronald Fagin, Alan Nash
113
Voted
OPODIS
2007
15 years 2 months ago
Small-World Networks: From Theoretical Bounds to Practical Systems
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....
François Bonnet, Anne-Marie Kermarrec, Mich...
ENVSOFT
2007
108views more  ENVSOFT 2007»
15 years 22 days ago
Modeling biocomplexity - actors, landscapes and alternative futures
: Increasingly, models (and modelers) are being asked to address the interactions between human influences, ecological processes, and landscape dynamics that impact many diverse as...
John P. Bolte, David W. Hulse, Stanley V. Gregory,...