Sciweavers

699 search results - page 139 / 140
» The method of combinatorial telescoping
Sort
View
89
Voted
JCB
2007
118views more  JCB 2007»
14 years 10 months ago
Discovering Topological Motifs Using a Compact Notation
Discovering topological motifs or common topologies in one or more graphs is an important as well as an interesting problem. It had been classically viewed as the subgraph isomorp...
Laxmi Parida
TOPLAS
2008
81views more  TOPLAS 2008»
14 years 10 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram
109
Voted
BMCBI
2004
146views more  BMCBI 2004»
14 years 10 months ago
Defining transcriptional networks through integrative modeling of mRNA expression and transcription factor binding data
Background: Functional genomics studies are yielding information about regulatory processes in the cell at an unprecedented scale. In the yeast S. cerevisiae, DNA microarrays have...
Feng Gao, Barrett C. Foat, Harmen J. Bussemaker
99
Voted
BMCBI
2004
138views more  BMCBI 2004»
14 years 10 months ago
Constraint Logic Programming approach to protein structure prediction
Background: The protein structure prediction problem is one of the most challenging problems in biological sciences. Many approaches have been proposed using database information ...
Alessandro Dal Palù, Agostino Dovier, Feder...
MOR
2002
94views more  MOR 2002»
14 years 10 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel