Can a breakpoint graph be decomposed into none other than 2-cycles?

Lianrong Pu; Haitao Jiang

doi:10.1007/978-3-319-39817-4_20

Can a breakpoint graph be decomposed into none other than 2-cycles?

Lianrong Pu, Haitao Jiang^*

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Breakpoint graph is a key data structure to study genome rearrangements. The problem of Breakpoint Graph Decomposition (BGD), which asks for a largest collection of edge-disjoint cycles in a breakpoint graph, is a crucial step in computing rearrangement distances between genomes. This problem for genomes of unsigned genes is proved NP-hard, and the best known approximation ratio is 1.4193+ε [1]. In this paper, we present a polynomial time algorithm to detect whether a breakpoint graph can be decomposed into none other than 2-cycles. Our algorithm can be used to detect if there exists a sorting scenario between two genomes without reusing any breakpoints.

Original language	English
Title of host publication	Frontiers in Algorithmics - 10th International Workshop, FAW 2016, Proceedings
Editors	Sergey Bereg, Daming Zhu
Publisher	Springer Verlag
Pages	205-214
Number of pages	10
ISBN (Print)	9783319398167
DOIs	https://doi.org/10.1007/978-3-319-39817-4_20
State	Published - 2016
Externally published	Yes
Event	10th International Workshop on Frontiers in Algorithmics, FAW 2016 - Qingdao, China Duration: 30 Jun 2016 → 2 Jul 2016

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	9711
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	10th International Workshop on Frontiers in Algorithmics, FAW 2016
Country/Territory	China
City	Qingdao
Period	30/06/16 → 2/07/16

Keywords

Breakpoint graph
Cycle decomposition
Genome rearrangement

Access to Document

10.1007/978-3-319-39817-4_20

Cite this

Pu, L., & Jiang, H. (2016). Can a breakpoint graph be decomposed into none other than 2-cycles? In S. Bereg, & D. Zhu (Eds.), Frontiers in Algorithmics - 10th International Workshop, FAW 2016, Proceedings (pp. 205-214). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9711). Springer Verlag. https://doi.org/10.1007/978-3-319-39817-4_20

Pu, Lianrong ; Jiang, Haitao. / Can a breakpoint graph be decomposed into none other than 2-cycles?. Frontiers in Algorithmics - 10th International Workshop, FAW 2016, Proceedings. editor / Sergey Bereg ; Daming Zhu. Springer Verlag, 2016. pp. 205-214 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{f83b6ac32adf4886b7f9a824a980f7dc,

title = "Can a breakpoint graph be decomposed into none other than 2-cycles?",

abstract = "Breakpoint graph is a key data structure to study genome rearrangements. The problem of Breakpoint Graph Decomposition (BGD), which asks for a largest collection of edge-disjoint cycles in a breakpoint graph, is a crucial step in computing rearrangement distances between genomes. This problem for genomes of unsigned genes is proved NP-hard, and the best known approximation ratio is 1.4193+ε [1]. In this paper, we present a polynomial time algorithm to detect whether a breakpoint graph can be decomposed into none other than 2-cycles. Our algorithm can be used to detect if there exists a sorting scenario between two genomes without reusing any breakpoints.",

keywords = "Breakpoint graph, Cycle decomposition, Genome rearrangement",

author = "Lianrong Pu and Haitao Jiang",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.; 10th International Workshop on Frontiers in Algorithmics, FAW 2016 ; Conference date: 30-06-2016 Through 02-07-2016",

year = "2016",

doi = "10.1007/978-3-319-39817-4_20",

language = "אנגלית",

isbn = "9783319398167",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "205--214",

editor = "Sergey Bereg and Daming Zhu",

booktitle = "Frontiers in Algorithmics - 10th International Workshop, FAW 2016, Proceedings",

}

Pu, L & Jiang, H 2016, Can a breakpoint graph be decomposed into none other than 2-cycles? in S Bereg & D Zhu (eds), Frontiers in Algorithmics - 10th International Workshop, FAW 2016, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9711, Springer Verlag, pp. 205-214, 10th International Workshop on Frontiers in Algorithmics, FAW 2016, Qingdao, China, 30/06/16. https://doi.org/10.1007/978-3-319-39817-4_20

Can a breakpoint graph be decomposed into none other than 2-cycles? / Pu, Lianrong; Jiang, Haitao.
Frontiers in Algorithmics - 10th International Workshop, FAW 2016, Proceedings. ed. / Sergey Bereg; Daming Zhu. Springer Verlag, 2016. p. 205-214 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9711).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review