Sciweavers

13 search results - page 1 / 3
» Sorting by Transpositions
Sort
View
SIAMDM
2010
105views more  SIAMDM 2010»
12 years 11 months ago
A Lower Bound on the Transposition Diameter
Sorting permutations by transpositions is an important and difficult problem in genome rearrangements. The transposition diameter TD(n) is the maximum transposition distance among ...
Linyuan Lu, Yiting Yang
JDA
2008
122views more  JDA 2008»
13 years 4 months 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
RECOMB
2006
Springer
14 years 4 months 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
CPM
2007
Springer
88views Combinatorics» more  CPM 2007»
13 years 10 months ago
A New and Faster Method of Sorting by Transpositions
Maxime Benoît-Gagné, Sylvie Hamel