154 search results - page 3 / 31 » A polyhedral approach to sequence alignment problems |
RECOMB
2001
Springer
14 years 7 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...
RECOMB
2009
Springer
14 years 8 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 ...
RECOMB
2012
Springer
11 years 9 months ago
2012
Springer
We develop a novel and general approach to estimating the accuracy of protein multiple sequence alignments without knowledge of a reference alignment, and use our approach to addre...
BIB
2006
13 years 7 months ago
2006
One of the major goals of computational sequence analysis is to find sequence similarities, which could serve as evidence of structural and functional conservation, as well as of ...
CC
2008
Springer
13 years 9 months ago
2008
Springer
The polyhedral model provides powerful abstractions to optimize loop nests with regular accesses. Affine transformations in this model capture a complex sequence of execution-reord...