Sciweavers

9 search results - page 1 / 2
» A 1.375-Approximation Algorithm for Sorting by Transposition...
Sort
View
106
Voted
JDA
2008
122views more  JDA 2008»
15 years 2 days ago
An approximation algorithm for sorting by reversals and transpositions
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a ...
Atif Rahman, Swakkhar Shatabda, Masud Hasan
125
Voted
RECOMB
2006
Springer
16 years 26 days ago
Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions
Abstract. During evolution, genomes are subject to genome rearrangements that alter the ordering and orientation of genes on the chromosomes. If a genome consists of a single chrom...
Martin Bader, Enno Ohlebusch
84
Voted
WABI
2005
Springer
15 years 6 months ago
A 1.375-Approximation Algorithm for Sorting by Transpositions
Isaac Elias, Tzvika Hartman