scientific article; zbMATH DE number 1405677
From MaRDI portal
Publication:4938658
Recommendations
- Signed genome rearrangement by reversals and transpositions: Models and approximations
- Algorithms for multiple genome rearrangements by signed reversals
- Permutation patterns in genome rearrangement problems: the reversal model
- A bound for the reversal distance of genome rearrangements
- A new algebraic approach to genome rearrangement models
- Genome Rearrangements and Sorting by Reversals
- Models and algorithms for genome rearrangement with positional constraints
- A 2-approximation algorithm for genome rearrangements by reversals and transpositions
- Signed rearrangement distances considering repeated genes, intergenic regions, and indels
- The Deletion-Insertion model applied to the genome rearrangement problem
Cited in
(13)- An approximation algorithm for sorting by reversals and transpositions
- A new approximation algorithm for sorting of signed permutations
- Heuristics for the sorting signed permutations by reversals and transpositions problem
- Sorting permutations by limited-size operations
- Approximation algorithms for sorting by \(k\)-cuts on signed permutations
- Genome Rearrangement Algorithms for Unsigned Permutations with O(logn) Singletons
- Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions
- Pancake flipping and sorting permutations
- The Deletion-Insertion model applied to the genome rearrangement problem
- Extension of the Bafna-Pevzner theory for the transposition sorting problem
- Sorting permutations by prefix and suffix versions of reversals and transpositions
- Signed genome rearrangement by reversals and transpositions: Models and approximations
- Sorting signed permutations by tandem duplication random loss and inverse tandem duplication random loss
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4938658)
