Revisiting the Minimum Breakpoint Linearization Problem Theoretical Computer Science
type: Dataset
description: International audience
landing page: 0304-3975
keyword: approximation-algorithms
keyword: breakpoint-distance
keyword: comparative-genomics
keyword: infoeu-reposemanticsarticle
keyword: infoinfo-bicomputer-science-csbioinformatics-q-bioqm
keyword: infoinfo-cccomputer-science-cscomputational-complexity-cscc
keyword: journal-articles
keyword: partially-ordered-genome
keyword: sdvbibslife-sciences-q-bioquantitative-methods-q-bioqm
issued: 2026-05-10T23:53:08.640761
modified: 2026-05-10T23:53:08.640766
language: en
contact point: Organization
  fn: CCSD

test_moissonnage_selune
type: Agent

Revisiting the Minimum Breakpoint Linearization Problem Theoretical Computer Science
type: Distribution
format: HTML
access URL: https://hal.science/hal-00826880
issued: 2026-05-10T23:53:08.642512
modified: 2026-05-10T23:53:08.628651