On sorting by translocations
From MaRDI portal
Recommendations
- Polynomial-Time Algorithm for Sorting by Generalized Translocations
- Sorting genomes by generalized translocations
- A linear-time algorithm for computing translocation distance between signed genomes
- scientific article; zbMATH DE number 910919
- An $O(n^{3/2}\sqrt{\log (n)})$ Algorithm for Sorting by Reciprocal Translocations
Cited in
(19)- Efficient algorithms for multichromosomal genome rearrangements.
- Genome rearrangements: a correct algorithm for optimal capping
- Reducibility of gene patterns in ciliates using the breakpoint graph.
- A 1.75-approximation algorithm for unsigned translocation distance
- On Sorting by 3-Bounded Transpositions
- Exemplar or matching: modeling DCJ problems with unequal content genome data
- A New and Faster Method of Sorting by Transpositions
- Working on the problem of sorting by transpositions on genome rearrangements
- Polynomial-Time Algorithm for Sorting by Generalized Translocations
- Sorting genomes by generalized translocations
- scientific article; zbMATH DE number 910919 (Why is no real title available?)
- Rearrangements in phylogenetic inference: compare, model, or encode?
- A retrospective on genomic preprocessing for comparative genomics
- The potential of family-free genome comparison
- An $O(n^{3/2}\sqrt{\log (n)})$ Algorithm for Sorting by Reciprocal Translocations
- A linear-time algorithm for computing translocation distance between signed genomes
- An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations
- The fibers and range of reduction graphs in ciliates
- Strategies of loop recombination in ciliates
This page was built for publication: On sorting by translocations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5706911)
