Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles?

DOI10.1007/978-3-319-39817-4_20zbMath1475.68101OpenAlexW2486810668MaRDI QIDQ4632186

Lianrong Pu, Haitao Jiang

Publication date: 26 April 2019

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-39817-4_20

zbMATH Keywords

genome rearrangementcycle decompositionbreakpoint graph

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Genetics and epigenetics (92D10) Data structures (68P05) Computational methods for problems pertaining to biology (92-08)

Related Items (1)

A 1.375-approximation algorithm for unsigned translocation sorting

Cites Work

• On the tightness of the alternating-cycle lower bound for sorting by reversals
• A further improved approximation algorithm for breakpoint graph decomposition
• The Approximability of the Exemplar Breakpoint Distance Problem
• Unnamed Item
• Unnamed Item

This page was built for publication: Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles?