2877 search results - page 195 / 576 » Computational Biology |
125
click to vote
RECOMB
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. Accurate comparative analysis tools for low-homology proteins remains a difficult challenge in computational biology, especially sequence alignment and consensus folding ...
153
click to vote
RECOMB
2007
Springer
16 years 4 months ago
2007
Springer
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
126
click to vote
RECOMB
2005
Springer
16 years 4 months ago
2005
Springer
Abstract. Gene rearrangements have been used successfully in phylogenetic reconstruction and comparative genomics, but usually under the assumption that all genomes have the same g...
162
click to vote
WEA
2010
Springer
15 years 11 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
147
Voted
BICOB
2010
Springer
15 years 2 months ago
2010
Springer
Fold recognition is a key problem in computational biology that involves classifying protein sharing structural similarities into classes commonly known as "folds". Rece...