Background: Probabilistic models for sequence comparison (such as hidden Markov models and pair hidden Markov models for proteins and mRNAs, or their context-free grammar counterp...
Background: Biologically active sequence motifs often have positional preferences with respect to a genomic landmark. For example, many known transcription factor binding sites (T...
Nak-Kyeong Kim, Kannan Tharakaraman, Leonardo Mari...
Probabilistic models of languages are fundamental to understand and learn the profile of the subjacent code in order to estimate its entropy, enabling the verification and predicti...
Protein chimerism is a phenomenon involving the combination of multiple ancestral sequences into a single, multi-domain protein through evolution. We propose a novel method for de...
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...