Sorting genomes by generalized translocations
From MaRDI portal
Recommendations
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?)
- An $O(n^{3/2}\sqrt{\log (n)})$ Algorithm for Sorting by Reciprocal Translocations
- Polynomial-time algorithm for computing translocation distance between genomes
- Transforming cabbage into turnip
Cited in
(6)- Polynomial-Time Algorithm for Sorting by Generalized Translocations
- An $O(n^{3/2}\sqrt{\log (n)})$ Algorithm for Sorting by Reciprocal Translocations
- Research in Computational Molecular Biology
- Sorting by Cuts, Joins and Whole Chromosome Duplications
- Finding Local Genome Rearrangements
- An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations
This page was built for publication: Sorting genomes by generalized translocations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q387818)