A linear-time algorithm for computing translocation distance between signed genomes
From MaRDI portal
Recommendations
Cited in
(12)- A new linear time algorithm to compute the genomic distance via the double cut and join distance
- scientific article; zbMATH DE number 910919 (Why is no real title available?)
- A retrospective on genomic preprocessing for comparative genomics
- A linear-time algorithm for the copy number transformation problem
- On sorting by translocations
- Polynomial-time algorithm for computing translocation distance between genomes
- An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations
- Exact and approximation algorithms for the contiguous translocation distance problem
- Linear algorithm for a cyclic graph transformation
- A randomized FPT approximation algorithm for sorting unsigned genomes by translocations: breaking the 1.375 approximation barrier
- On the complexity of unsigned translocation distance
- A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations
This page was built for publication: A linear-time algorithm for computing translocation distance between signed genomes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315341)
