Sciweavers

6 search results - page 1 / 2
» A Lower Bound on the Reversal and Transposition Diameter
Sort
View
JCB
2002
102views more  JCB 2002»
13 years 4 months ago
A Lower Bound on the Reversal and Transposition Diameter
One possible model to study genome evolution is to represent genomes as permutations of genes and compute distances based on the minimum number of certain operations (rearrangemen...
João Meidanis, Maria Emilia Telles Walter, ...
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
2007
Springer
14 years 5 months ago
Multi-break Rearrangements: From Circular to Linear Genomes
Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2break rearrangements represent standard reversals, fusions, ...
Max A. Alekseyev
JCB
2008
144views more  JCB 2008»
13 years 4 months ago
Multi-Break Rearrangements and Breakpoint Re-Uses: From Circular to Linear Genomes
Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2-break rearrangements represent standard reversals, fusions...
Max A. Alekseyev