Approximation algorithms for the median problem in the breakpoint model
From MaRDI portal
Recommendations
- The median problem for breakpoints in comparative genomics
- Algorithms for the genome median under a restricted measure of rearrangement
- Median approximations for genomes modeled as matrices
- scientific article; zbMATH DE number 2073943
- The median problem for the reversal distance in circular bacterial genomes
Cited in
(15)- Asymptotic medians of random permutations sampled from reversal random walks
- A further improved approximation algorithm for breakpoint graph decomposition
- Fast median computation for symmetric, orthogonal matrices under the rank distance
- BEAMR: an exact and approximate model for the p-median problem
- Median approximations for genomes modeled as matrices
- Revisiting the minimum breakpoint linearization problem
- Revisiting the minimum breakpoint linearization problem
- The median problem for breakpoints in comparative genomics
- Additive Bounding, Worst-Case Analysis, and the Breakpoint Median Problem
- Finding an optimal inversion median: experimental results
- Mixed and circular multichromosomal genomic median problem
- The median problem for the reversal distance in circular bacterial genomes
- Algorithms for the genome median under a restricted measure of rearrangement
- An efficient Benders decomposition for the \(p\)-median problem
- A lower bound for the breakpoint phylogeny problem
This page was built for publication: Approximation algorithms for the median problem in the breakpoint model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5457094)