Sciweavers

61 search results - page 5 / 13
» Simple and Fast Inverse Alignment
Sort
View
WABI
2009
Springer
128views Bioinformatics» more  WABI 2009»
14 years 5 months ago
A General Framework for Local Pairwise Alignment Statistics with Gaps
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...
Pasi Rastas
RECOMB
2003
Springer
14 years 11 months ago
Designing seeds for similarity search in genomic DNA
Large-scale comparison of genomic DNA is of fundamental importance in annotating functional elements of genomes. To perform large comparisons efficiently, BLAST (Methods: Companio...
Jeremy Buhler, Uri Keich, Yanni Sun
CVPR
2011
IEEE
13 years 7 months ago
Fast Cost-Volume Filtering for Visual Correspondence and Beyond
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...
Christoph Rhemann, Asmaa Hosni, Michael Bleyer, Ca...
PPSN
1998
Springer
14 years 3 months ago
Inver-over Operator for the TSP
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...
Guo Tao, Zbigniew Michalewicz
BMCBI
2008
125views more  BMCBI 2008»
13 years 11 months ago
A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions
Background: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. Howe...
Martin Bader, Mohamed Ibrahim Abouelhoda, Enno Ohl...