Exemplar or matching: modeling DCJ problems with unequal content genome data

DOI10.1007/s10878-015-9940-4zbMath1356.90131arXiv1705.06559OpenAlexW3101082440MaRDI QIDQ346504

Stephen W. Schaeffer, Zhaoming Yin, Jijun Tang, David A. Bader

Publication date: 29 November 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.06559

zbMATH Keywords

genome rearrangementLin-Kernighan heuristicdouble-cut and join (DCJ)

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

A linear algorithm for restructuring a graph, Linear algorithm for a cyclic graph transformation

Uses Software

• GASTS

Cites Work

• Unnamed Item
• Steps toward accurate reconstructions of phylogenies from gene-order data.
• The Reversal Median Problem
• Erratum: The Approximability of the Exemplar Breakpoint Distance Problem
• Genomes Containing Duplicates Are Hard to Compare
• On the Approximability of Comparing Genomes with Duplicates
• Sorting by Transpositions
• Vector-valued wavelets with triangular support for method of moments applications
• Research in Computational Molecular Biology