A faster algorithm for sorting by reciprocal translocations
From MaRDI portal
Cites work
- A data structure for dynamic trees
- Advances on sorting by reversals
- An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations
- Biased Search Trees
- Faster deterministic fully-dynamic graph connectivity
- scientific article; zbMATH DE number 1306890 (Why is no real title available?)
- scientific article; zbMATH DE number 910919 (Why is no real title available?)
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Polynomial-time algorithm for computing translocation distance between genomes
- Self-adjusting binary search trees
- Sorting signed permutations by reversals in nearly-linear time
- Sorting signed permutations by reversals, revisited
This page was built for publication: A faster 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 Q7442700)