2834 search results - page 59 / 567 » Representing Trees with Constraints |
POPL
2002
ACM
14 years 9 months ago
2002
ACM
We investigate the first-order theory of subtyping constraints. We show that the first-order theory of nonstructural subtyping is undecidable, and we show that in the case where a...
GCB
1997
Springer
14 years 1 months ago
1997
Springer
We present a global search technique for nding the global minimal conformation of a sequence in Dill's HP-lattice model5;6 . The HP-lattice model is a simpli ed model of prot...
CORR
2004
Springer
13 years 8 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
ICML
2004
IEEE
14 years 9 months ago
2004
IEEE
Conditional Random Fields (CRFs; Lafferty, McCallum, & Pereira, 2001) provide a flexible and powerful model for learning to assign labels to elements of sequences in such appl...
WABI
2004
Springer
14 years 2 months ago
2004
Springer
Computational heuristics are the primary methods for reconstruction of phylogenetic trees on large datasets. Most large-scale phylogenetic analyses produce numerous trees that are ...