SIAMCOMP
2000
13 years 11 months ago
2000
This paper studies various algorithmic issues in reconstructing a species tree from gene trees under the duplication and the mutation cost model. This is a fundamental problem in c...
IDA
2006
Springer
13 years 11 months ago
2006
Springer
We introduce in this paper a generalization of the widely used hidden Markov models (HMM's), which we name "structural hidden Markov models" (SHMM). Our approach is ...
BMCBI
2007
13 years 11 months ago
2007
Background: Identification of protein interacting sites is an important task in computational molecular biology. As more and more protein sequences are deposited without available...
ESWA
2006
13 years 11 months ago
2006
Artificial intelligence (AI) has increasingly gained attention in bioinformatics research and computational molecular biology. With the availability of different types of AI algor...
ALMOB
2006
13 years 11 months ago
2006
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
CPM
2004
Springer
14 years 3 months ago
2004
Springer
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
PREMI
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. Technological advances in experimental and computational molecular biology have revolutionized the whole fields of biology and medicine. Large-scale sequencing, expressio...
CPM
2005
Springer
14 years 5 months ago
2005
Springer
Gene structure prediction is one of the most important problems in computational molecular biology. It involves two steps: the first is finding the evidence (e.g. predicting spl...
SAC
2009
ACM
14 years 6 months ago
2009
ACM
The prediction of the correct secondary structures of large RNAs is one of the unsolved challenges of computational molecular biology. Among the major obstacles is the fact that a...
RECOMB
2001
Springer
14 years 11 months ago
2001
Springer
The Smith-Waterman algorithm for local sequence alignment is one of the most important techniques in computational molecular biology. This ingenious dynamic programming approach w...