Computation of multiple sequence alignments is one of the major open problems in computational molecular biology. The purpose of this study was to provide a new method, PAC (Progre...
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...
Frequently, sequences of state transitions are triggered by specific signals. Learning these triggered sequences with recurrent neural networks implies storing them as different at...
Background: Alignments of homologous DNA sequences are crucial for comparative genomics and phylogenetic analysis. However, multiple alignment represents a computationally difficu...
We consider the supervised learning of a binary classifier from noisy observations. We use smooth boosting to linearly combine abstaining hypotheses, each of which maps a subcube...