Sciweavers

9504 search results - page 24 / 1901
» Dynamic Substitution Model
Sort
View
COLING
2000
13 years 9 months ago
Parsing with the Shortest Derivation
Common wisdom has it that tile bias of stochastic grammars in favor of shorter deriwttions of a sentence is hamfful and should be redressed. We show that the common wisdom is wron...
Rens Bod
IANDC
2006
83views more  IANDC 2006»
13 years 7 months ago
Implicit complexity over an arbitrary structure: Quantifier alternations
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We...
Olivier Bournez, Felipe Cucker, Paulin Jacob&eacut...
RECOMB
2002
Springer
14 years 8 months ago
DNA sequence evolution with neighbor-dependent mutation
We introduce a model of DNA sequence evolution which can account for biases in mutation rates that depend on the identity of the neighboring bases. An analytic solution for this c...
Peter F. Arndt, Christopher B. Burge, Terence Hwa
EMNLP
2008
13 years 9 months ago
Attacking Decipherment Problems Optimally with Low-Order N-gram Models
We introduce a method for solving substitution ciphers using low-order letter n-gram models. This method enforces global constraints using integer programming, and it guarantees t...
Sujith Ravi, Kevin Knight
TCBB
2008
76views more  TCBB 2008»
13 years 7 months ago
Hadamard Conjugation for the Kimura 3ST Model: Combinatorial Proof Using Path Sets
Under a stochastic model of molecular sequence evolution the probability of each possible pattern of characters is well defined. The Kimura's three-substitution-types (K3ST) m...
Michael D. Hendy, Sagi Snir