Revisiting the minimum breakpoint linearization problem

DOI10.1007/978-3-642-13562-0_16zbMATH Open1284.92055MaRDI QIDQ3569073FDOQ3569073

Authors: Laurent Bulteau, Guillaume Fertin, Irena Rusu 

Publication date: 17 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Recommendations

• Revisiting the minimum breakpoint linearization problem
• scientific article; zbMATH DE number 1088277
• The complexity of gene placement
• Approximation algorithms for the median problem in the breakpoint model
• A further improved approximation algorithm for breakpoint graph decomposition

Mathematics Subject Classification ID

Genetics and epigenetics (92D10)

Cited In (5)

• Revisiting the minimum breakpoint linearization problem
• Canonical piecewise-linear analysis: Generalized breakpoint hopping algorithm
• Semidefinite programming based approaches to the break minimization problem
• Linearizing genomes: exact methods and local search
• Computing and Combinatorics

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

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