549 search results - page 19 / 110 » Constraint Programming in Structural Bioinformatics |
110
Voted
IPCO
2008
15 years 1 months ago
2008
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
170
click to vote
POPL
2011
ACM
14 years 3 months ago
2011
ACM
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
ICALP
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
97
Voted
BMCBI
2006
15 years 14 days ago
2006
Background: Benchmarking algorithms in structural bioinformatics often involves the construction of datasets of proteins with given sequence and structural properties. The SCOP da...
103
click to vote
EUROGP
2003
Springer
15 years 5 months ago
2003
Springer
We introduce a new recombination operator, the Maximum Homologous Crossover for Linear Genetic Programming. In contrast to standard crossover, it attempts to preserve similar struc...