Signed genome rearrangement by reversals and transpositions: Models and approximations
From MaRDI portal
Publication:5941291
DOI10.1016/S0304-3975(00)00038-4zbMath0972.68052OpenAlexW2050415106MaRDI QIDQ5941291
No author found.
Publication date: 20 August 2001
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00038-4
Related Items (10)
Optimal algorithms for uncovering synteny problem ⋮ Sorting by \(k\)-cuts on signed permutations ⋮ Rearrangement events on circular genomes ⋮ A new approximation algorithm for sorting of signed permutations ⋮ A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations ⋮ Multi-break rearrangements and chromosomal evolution ⋮ Approximation algorithms for sorting by length-weighted prefix and suffix operations ⋮ The Cayley network of expanded Pancake graphs ⋮ A simpler and faster 1.5-approximation algorithm for sorting by transpositions ⋮ Approximation algorithms for sorting by \(k\)-cuts on signed permutations
Cites Work
This page was built for publication: Signed genome rearrangement by reversals and transpositions: Models and approximations
