Revisiting the minimum breakpoint linearization problem

DOI10.1016/j.tcs.2012.12.026zbMath1295.92020OpenAlexW2153361300MaRDI QIDQ391095

Laurent Bulteau, Guillaume Fertin, Irena Rusu

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.12.026

zbMATH Keywords

approximation algorithmsbreakpoint distancecomparative genomicspartially ordered genome

Mathematics Subject Classification ID

Applications of graph theory (05C90) Genetics and epigenetics (92D10) Approximation algorithms (68W25)

Related Items (1)

An efficient algorithm for one-sided block ordering problem under block-interchange distance

Cites Work

• Optimization, approximation, and complexity classes
• Revisiting the Minimum Breakpoint Linearization Problem
• Approximating minimum feedback sets and multi-cuts in directed graphs
• Computing and Combinatorics

This page was built for publication: Revisiting the minimum breakpoint linearization problem