On the DCJ Median Problem

DOI10.1007/978-3-319-07566-2_28MaRDI QIDQ5165613zbMATH OpenOpenAlexFDO

Authors Mingfu Shao, Bernard M. E. Moret

Publication date 30 June 2014

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-07566-2_28

zbMATH Keywords

dynamic programminggenomic rearrangementnetwork flow

Mathematics Subject Classification ID

Dynamic programming (90C39) Systems biology, networks (92C42) Genetics and epigenetics (92D10)

Recommendations

• Constructing a DC decomposition for ordered median problems
• scientific article; zbMATH DE number 4209907
• On the conditional \(p\)-median problem
• A computational study for the p-median problem
• The distance-constrained matroid median problem
• A tighter formulation of the p-median problem
• scientific article; zbMATH DE number 3915986
• The matroid median problem
• A note on solving large p-median problems

Cited in

(9)

• Constructing a DC decomposition for ordered median problems
• Breakpoint distance and PQ-trees
• A uniform theory of adequate subgraphs for the genome median, halving, and aliquoting problems
• A Lin-Kernighan heuristic for the DCJ median problem of genomes with unequal contents
• Median approximations for genomes modeled as matrices
• Exemplar or matching: modeling DCJ problems with unequal content genome data
• Finding an Optimal Inversion Median: Experimental Results
• Mixed and circular multichromosomal genomic median problem
• Algorithms for the genome median under a restricted measure of rearrangement

This page was built for publication: On the DCJ Median Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5165613)