Approximation algorithms for the median problem in the breakpoint model

MaRDI QIDQ5457094zbMATH OpenFDO

Authors Itsik Pe'er, Ron Shamir

Publication date 14 April 2008

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Applications of graph theory (05C90) Computational methods for problems pertaining to biology (92-08) Biochemistry, molecular biology (92C40)

Recommendations

• scientific article; zbMATH DE number 1088277
• Algorithms for the genome median under a restricted measure of rearrangement
• Median approximations for genomes modeled as matrices
• scientific article; zbMATH DE number 2073943
• Combinatorial Pattern Matching

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
• scientific article; zbMATH DE number 1088277 (Why is no real title available?)
• Additive Bounding, Worst-Case Analysis, and the Breakpoint Median Problem
• Finding an Optimal Inversion Median: Experimental Results
• Mixed and circular multichromosomal genomic median problem
• Combinatorial Pattern Matching
• 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)