Polynomial-time algorithm for computing translocation distance between genomes
From MaRDI portal
Recommendations
Cites work
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- Genome Rearrangements and Sorting by Reversals
- scientific article; zbMATH DE number 4218025 (Why is no real title available?)
- scientific article; zbMATH DE number 1263193 (Why is no real title available?)
- scientific article; zbMATH DE number 1306890 (Why is no real title available?)
- scientific article; zbMATH DE number 910919 (Why is no real title available?)
- scientific article; zbMATH DE number 910920 (Why is no real title available?)
Cited in
(28)- Edit distance with block deletions
- Reconstructing an ancestral genome using minimum segments duplications and reversals.
- Efficient algorithms for multichromosomal genome rearrangements.
- Exploiting pseudo-locality of interchange distance
- A 1.375-approximation algorithm for unsigned translocation sorting
- The complexity of string partitioning
- The spectral gap of graphs arising from substring reversals
- Edit distance with move operations
- Can a breakpoint graph be decomposed into none other than 2-cycles?
- A 1.75-approximation algorithm for unsigned translocation distance
- A note on complexity of genetic mutations
- Sorting by Cuts, Joins and Whole Chromosome Duplications
- 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?)
- A retrospective on genomic preprocessing for comparative genomics
- Combinatorial Pattern Matching
- Transposition rearrangement: linear algorithm for length-cost model
- A 14/11-approximation algorithm for sorting by short block-moves
- Sorting with fixed-length reversals
- An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations
- Exact and approximation algorithms for the contiguous translocation distance problem
- A randomized FPT approximation algorithm for sorting unsigned genomes by translocations: breaking the 1.375 approximation barrier
- Exploiting pseudo-locality of interchange distance
- On the complexity of unsigned translocation distance
- An efficient algorithm for one-sided block ordering problem under block-interchange distance
- A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations
- An improved algorithm for sorting by block-interchanges based on permutation groups
This page was built for publication: Polynomial-time algorithm for computing translocation distance between genomes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961622)
