61 search results - page 5 / 13 » Simple and Fast Inverse Alignment |
105
click to vote
WABI
2009
Springer
15 years 7 months ago
2009
Springer
We present a novel dynamic programming framework that allows one to compute tight upper bounds for the p-values of gapped local alignments in pseudo–polynomial time. Our algorith...
83
Voted
RECOMB
2003
Springer
16 years 26 days ago
2003
Springer
Large-scale comparison of genomic DNA is of fundamental importance in annotating functional elements of genomes. To perform large comparisons efficiently, BLAST (Methods: Companio...
108
Voted
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
Many computer vision tasks can be formulated as labeling problems. The desired solution is often a spatially smooth labeling where label transitions are aligned with color edges o...
99
Voted
PPSN
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. In this paper we investigate the usefulness of a new operator, inver-over, for an evolutionary algorithm for the TSP. Inver-over is based on simple inversion, however, kn...
105
Voted
BMCBI
2008
15 years 20 days ago
2008
Background: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. Howe...