A faster algorithm for genomic sorting problem
From MaRDI portal
Recommendations
- An $O(n^{3/2}\sqrt{\log (n)})$ Algorithm for Sorting by Reciprocal Translocations
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- Combinatorial Pattern Matching
- Genome Rearrangements and Sorting by Reversals
- An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations
Cited in
(4)- An improved quicksort algorithm based on tissue-like P systems with promoters
- Genome rearrangements: a correct algorithm for optimal capping
- The matrix iteration algorithm solving an enumeration problem on bacterial complete genomes
- A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions
This page was built for publication: A faster algorithm for genomic sorting problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3431147)
