Sciweavers

165 search results - page 1 / 33
» Parallel Algorithm for Computing Reversal Distance
Sort
View
ICPR
2008
IEEE
14 years 5 months ago
Distance transformation, reverse distance transformation and discrete medial axis on toric spaces
In this paper, we present optimal in time algorithms to compute the distance transform, the reverse distance transform and the discrete medial axis on digital objects embedded on ...
David Coeurjolly
CIBCB
2005
IEEE
13 years 10 months ago
Heuristic Algorithm for Computing Reversal Distance with MultiGene Families via Binary Integer Programming
— Hannenhalli and Pevzner developed the first polynomial-time algorithm for the combinatorial problem of sorting of signed genomic data. Their algorithm solves the minimum numbe...
Jakkarin Suksawatchon, Chidchanok Lursinsap, Mikae...
STOC
1995
ACM
194views Algorithms» more  STOC 1995»
13 years 8 months ago
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Genomes frequently evolve by reversals ␳(i, j) that transform a gene order ␲1 . . . ␲i␲iϩ1 . . . ␲jϪ1␲j . . . ␲n into ␲1 . . . ␲i␲jϪ1 . . . ␲iϩ1␲j . . ....
Sridhar Hannenhalli, Pavel A. Pevzner
TCS
2011
12 years 11 months ago
The transposition median problem is NP-complete
During the last years, the genomes of more and more species have been sequenced, providing data for phylogenetic reconstruction based on genome rearrangement measures, where the m...
Martin Bader