Sciweavers

2032 search results - page 78 / 407
» Encodings of the Sequence Constraint
Sort
View
BMCBI
2006
242views more  BMCBI 2006»
15 years 6 months ago
Predicting residue-wise contact orders in proteins by support vector regression
Background: The residue-wise contact order (RWCO) describes the sequence separations between the residues of interest and its contacting residues in a protein sequence. It is a ne...
Jiangning Song, Kevin Burrage
BMCBI
2005
147views more  BMCBI 2005»
15 years 6 months ago
GATA: a graphic alignment tool for comparative sequence analysis
Background: Several problems exist with current methods used to align DNA sequences for comparative sequence analysis. Most dynamic programming algorithms assume that conserved se...
David A. Nix, Michael B. Eisen
ENTCS
2008
85views more  ENTCS 2008»
15 years 6 months ago
Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
Salvador Lucas, Rafael Navarro-Marset
ISSTA
2004
ACM
15 years 11 months ago
Faster constraint solving with subtypes
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
Jonathan Edwards, Daniel Jackson, Emina Torlak, Vi...
SARA
2009
Springer
16 years 25 days ago
Common Subexpressions in Constraint Models of Planning Problems
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
Andrea Rendl, Ian Miguel, Ian P. Gent, Peter Grego...