Sciweavers

Share
6 search results - page 1 / 2
» Sorting by Weighted Reversals, Transpositions, and Inverted ...
Sort
View
RECOMB
2006
Springer
10 years 6 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
JDA
2008
122views more  JDA 2008»
9 years 5 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
BMCBI
2008
125views more  BMCBI 2008»
9 years 6 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...
RECOMB
2007
Springer
10 years 6 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
RECOMB
2010
Springer
9 years 4 months ago
The Problem of Chromosome Reincorporation in DCJ Sorting and Halving
We study two problems in the double cut and join (DCJ) model: sorting – transforming one multilinear genome into another and halving – transforming a duplicated genome into a p...
Jakub Kovác, Marília D. V. Braga, Je...
books