An Audit Tool for Genome Rearrangement Algorithms
From MaRDI portal
Publication:2828184
DOI10.1145/2661633zbMath1347.68106OpenAlexW2022060802MaRDI QIDQ2828184
Gustavo Rodrigues Galvão, Zanoni Dias
Publication date: 24 October 2016
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2661633
genome rearrangementssorting by prefix reversalsranking and unranking permutationssorting by prefix transpositions
Analysis of algorithms (68W40) Searching and sorting (68P10) Permutations, words, matrices (05A05) Genetics and epigenetics (92D10) Approximation algorithms (68W25)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Succinct representations of permutations and functions
- Pancake flipping is hard
- Bounding prefix transposition distance for strings and permutations
- An \((18/11)n\) upper bound for sorting by prefix reversals
- Advances on sorting by reversals
- An approximation algorithm for sorting by reversals and transpositions
- A 2-approximation algorithm for genome rearrangements by reversals and transpositions
- Sorting by bounded block-moves
- Ranking and unranking permutations in linear time
- On the problem of sorting burnt pancakes
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- The distribution of cycles in breakpoint graphs of signed permutations
- Improving the algorithm of Bafna and Pevzner for the problem of sorting by transpositions: a practical approach
- Lower Bounding Edit Distances between Permutations
- Sorting by Transpositions Is Difficult
- A Lower Bound on the Transposition Diameter
- A New and Faster Method of Sorting by Transpositions
- Sorting Permutations by Reversals and Eulerian Cycle Decompositions
- On the Diameter of the Pancake Network
- Sorting by Transpositions
- Genome Rearrangements and Sorting by Reversals
- Enumerating combinatorial classes of the complex polynomial vector fields in ℂ
- Algorithms – ESA 2005
- Sorting a bridge hand
This page was built for publication: An Audit Tool for Genome Rearrangement Algorithms
