Skip to main content
Article thumbnail
Location of Repository

A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions

By Martin Bader, Mohamed I Abouelhoda and Enno Ohlebusch
Topics: Methodology Article
Publisher: BioMed Central
OAI identifier: oai:pubmedcentral.nih.gov:2655097
Provided by: PubMed Central

Suggested articles

Citations

  1. (2005). A 1.5-Approximation Algorithm for Sorting by Transpositions and Transreversals.
  2. (2001). A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study.
  3. (2003). Genome Rearrangements in Mammalian Evolution: Lessons From Human and Mouse Genomes. Genome Research
  4. (2007). Ohlebusch E: Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions.
  5. (2004). Reversal Distance without Hurdles and Fortresses.
  6. (2005). Sorting by Weighted Transpositions and Reversals. Diploma thesis

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.