678 search results - page 68 / 136 » On Complexity Measures for Biological Sequences |
RECOMB
2009
Springer
15 years 12 months ago
2009
Springer
Prediction and alignment of RNA pseudoknot structures are NP-hard. Nevertheless, several efficient prediction algorithms by dynamic programming have been proposed for restricted cl...
120
click to vote
BMCBI
2007
14 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...
ALMOB
2008
14 years 11 months ago
2008
Background: It is of biological interest to make genome-wide predictions of the locations of DNA melting bubbles using statistical mechanics models. Computationally, this poses th...
BMCBI
2008
14 years 11 months ago
2008
Background: There are several situations in population biology research where simulating DNA sequences is useful. Simulation of biological populations under different evolutionary...
RECOMB
2009
Springer
15 years 12 months ago
2009
Springer
Finding similar structures from 3-D structure databases of proteins is becoming more and more important issue in the post-genomic molecular biology. To compare 3-D structures of tw...