An O(n^3/2 (n)) algorithm for sorting by reciprocal translocations
From MaRDI portal
Publication:655439
Recommendations
- An $O(n^{3/2}\sqrt{\log (n)})$ Algorithm for Sorting by Reciprocal Translocations
- Polynomial-Time Algorithm for Sorting by Generalized Translocations
- Sorting genomes by generalized translocations
- Research in Computational Molecular Biology
- A \((1.408+\varepsilon )\)-approximation algorithm for sorting unsigned genomes by reciprocal translocations
Cites work
- scientific article; zbMATH DE number 1306890 (Why is no real title available?)
- scientific article; zbMATH DE number 910919 (Why is no real title available?)
- A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
- A very elementary presentation of the Hannenhalli-Pevzner theory
- Advances on sorting by reversals
- An $O(n^{3/2}\sqrt{\log (n)})$ Algorithm for Sorting by Reciprocal Translocations
- Combinatorial Pattern Matching
- Combinatorial Pattern Matching
- Polynomial-time algorithm for computing translocation distance between genomes
- Sorting signed permutations by reversals, revisited
- Transforming cabbage into turnip
Cited in
(6)- A 1.375-approximation algorithm for unsigned translocation sorting
- A faster algorithm for genomic sorting problem
- An $O(n^{3/2}\sqrt{\log (n)})$ Algorithm for Sorting by Reciprocal Translocations
- A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations
- Sorting genomes by generalized translocations
- A retrospective on genomic preprocessing for comparative genomics
This page was built for publication: An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q655439)
