A new approximation algorithm for unsigned translocation sorting

Lianrong Pu; Daming Zhu; Haitao Jiang

doi:10.1007/978-3-319-43681-4_22

A new approximation algorithm for unsigned translocation sorting

Lianrong Pu, Daming Zhu^*, Haitao Jiang

^*Corresponding author for this work

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

Abstract

Translocation has long been learned as a basic operation to rearrange genomes. Signed translocation sorting can be solved in polynomial time. Unsigned translocation sorting turns to be NP-Hard and Max-SNP-Hard. The best known algorithm by now for unsigned translocation sorting can achieve a performance ratio 1.408. In this paper, we propose a new approximation algorithm for unsigned translocation sorting, which can achieve a performance ratio 1.375 in polynomial time.

Original language	English
Title of host publication	Algorithms in Bioinformatics - 16th International Workshop, WABI 2016, Proceedings
Editors	Martin Frith, Christian Nørgaard Storm Pedersen
Publisher	Springer Verlag
Pages	269-280
Number of pages	12
ISBN (Print)	9783319436807
DOIs	https://doi.org/10.1007/978-3-319-43681-4_22
State	Published - 2016
Externally published	Yes
Event	16th International Workshop on Algorithms in Bioinformatics, WABI 2016 - Aarhus, Denmark Duration: 22 Aug 2016 → 24 Aug 2016

Publication series

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

Conference

Conference	16th International Workshop on Algorithms in Bioinformatics, WABI 2016
Country/Territory	Denmark
City	Aarhus
Period	22/08/16 → 24/08/16

Keywords

Algorithm
Approximation
Complexity
Earrangement
Genome
Translocation

Access to Document

10.1007/978-3-319-43681-4_22

Cite this

Pu, L., Zhu, D., & Jiang, H. (2016). A new approximation algorithm for unsigned translocation sorting. In M. Frith, & C. N. S. Pedersen (Eds.), Algorithms in Bioinformatics - 16th International Workshop, WABI 2016, Proceedings (pp. 269-280). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9838 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-43681-4_22

Pu, Lianrong ; Zhu, Daming ; Jiang, Haitao. / A new approximation algorithm for unsigned translocation sorting. Algorithms in Bioinformatics - 16th International Workshop, WABI 2016, Proceedings. editor / Martin Frith ; Christian Nørgaard Storm Pedersen. Springer Verlag, 2016. pp. 269-280 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{0730a8ca709e436ba2223a350d929b99,

title = "A new approximation algorithm for unsigned translocation sorting",

abstract = "Translocation has long been learned as a basic operation to rearrange genomes. Signed translocation sorting can be solved in polynomial time. Unsigned translocation sorting turns to be NP-Hard and Max-SNP-Hard. The best known algorithm by now for unsigned translocation sorting can achieve a performance ratio 1.408. In this paper, we propose a new approximation algorithm for unsigned translocation sorting, which can achieve a performance ratio 1.375 in polynomial time.",

keywords = "Algorithm, Approximation, Complexity, Earrangement, Genome, Translocation",

author = "Lianrong Pu and Daming Zhu and Haitao Jiang",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.; 16th International Workshop on Algorithms in Bioinformatics, WABI 2016 ; Conference date: 22-08-2016 Through 24-08-2016",

year = "2016",

doi = "10.1007/978-3-319-43681-4_22",

language = "אנגלית",

isbn = "9783319436807",

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

publisher = "Springer Verlag",

pages = "269--280",

editor = "Martin Frith and Pedersen, {Christian N{\o}rgaard Storm}",

booktitle = "Algorithms in Bioinformatics - 16th International Workshop, WABI 2016, Proceedings",

}

Pu, L, Zhu, D & Jiang, H 2016, A new approximation algorithm for unsigned translocation sorting. in M Frith & CNS Pedersen (eds), Algorithms in Bioinformatics - 16th International Workshop, WABI 2016, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9838 LNCS, Springer Verlag, pp. 269-280, 16th International Workshop on Algorithms in Bioinformatics, WABI 2016, Aarhus, Denmark, 22/08/16. https://doi.org/10.1007/978-3-319-43681-4_22

A new approximation algorithm for unsigned translocation sorting. / Pu, Lianrong; Zhu, Daming; Jiang, Haitao.
Algorithms in Bioinformatics - 16th International Workshop, WABI 2016, Proceedings. ed. / Martin Frith; Christian Nørgaard Storm Pedersen. Springer Verlag, 2016. p. 269-280 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9838 LNCS).

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

TY - GEN

T1 - A new approximation algorithm for unsigned translocation sorting

AU - Pu, Lianrong

AU - Zhu, Daming

AU - Jiang, Haitao

N1 - Publisher Copyright: © Springer International Publishing Switzerland 2016.

PY - 2016

Y1 - 2016

N2 - Translocation has long been learned as a basic operation to rearrange genomes. Signed translocation sorting can be solved in polynomial time. Unsigned translocation sorting turns to be NP-Hard and Max-SNP-Hard. The best known algorithm by now for unsigned translocation sorting can achieve a performance ratio 1.408. In this paper, we propose a new approximation algorithm for unsigned translocation sorting, which can achieve a performance ratio 1.375 in polynomial time.

AB - Translocation has long been learned as a basic operation to rearrange genomes. Signed translocation sorting can be solved in polynomial time. Unsigned translocation sorting turns to be NP-Hard and Max-SNP-Hard. The best known algorithm by now for unsigned translocation sorting can achieve a performance ratio 1.408. In this paper, we propose a new approximation algorithm for unsigned translocation sorting, which can achieve a performance ratio 1.375 in polynomial time.

KW - Algorithm

KW - Approximation

KW - Complexity

KW - Earrangement

KW - Genome

KW - Translocation

UR - http://www.scopus.com/inward/record.url?scp=84984984932&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-43681-4_22

DO - 10.1007/978-3-319-43681-4_22

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84984984932

SN - 9783319436807

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 269

EP - 280

BT - Algorithms in Bioinformatics - 16th International Workshop, WABI 2016, Proceedings

A2 - Frith, Martin

A2 - Pedersen, Christian Nørgaard Storm

PB - Springer Verlag

T2 - 16th International Workshop on Algorithms in Bioinformatics, WABI 2016

Y2 - 22 August 2016 through 24 August 2016

ER -

Pu L, Zhu D, Jiang H. A new approximation algorithm for unsigned translocation sorting. In Frith M, Pedersen CNS, editors, Algorithms in Bioinformatics - 16th International Workshop, WABI 2016, Proceedings. Springer Verlag. 2016. p. 269-280. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-43681-4_22

A new approximation algorithm for unsigned translocation sorting

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this