A 1.75-approximation algorithm for unsigned translocation distance

Yun Cui; Lusheng Wang; Darning Zhu

doi:10.1007/11602613_40

A 1.75-approximation algorithm for unsigned translocation distance

Yun Cui
, Lusheng Wang
, Darning Zhu

Department of Computer Science

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

2 Citations (Scopus)

Abstract

The translocation operation is one of the popular operations for genome rearrangement. In this paper, we present a 1.75-approximation algorithm for computing unsigned translocation distance which improves upon the best known 2-approximation algorithm [1]. © Springer-Verlag Berlin Heidelberg 2005.

Original language	English
Title of host publication	Algorithms and Computation
Subtitle of host publication	16th International Symposium, ISAAC 2005, Proceedings
Publisher	Springer Verlag
Pages	392-401
Volume	3827 LNCS
ISBN (Print)	3540309357, 9783540309352
DOIs	https://doi.org/10.1007/11602613_40
Publication status	Published - 2005
Event	16th International Symposium on Algorithms and Computation (ISAAC 2005) - Hainan, China Duration: 19 Dec 2005 → 21 Dec 2005

Publication series

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

Conference

Conference	16th International Symposium on Algorithms and Computation (ISAAC 2005)
Place	China
City	Hainan
Period	19/12/05 → 21/12/05

Research Keywords

Approximation algorithm
Unsigned translocation distance

Access Output

10.1007/11602613_40

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

Cui, Y., Wang, L., & Zhu, D. (2005). A 1.75-approximation algorithm for unsigned translocation distance. In Algorithms and Computation: 16th International Symposium, ISAAC 2005, Proceedings (Vol. 3827 LNCS, pp. 392-401). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3827 LNCS). Springer Verlag. https://doi.org/10.1007/11602613_40

Cui, Yun ; Wang, Lusheng ; Zhu, Darning. / A 1.75-approximation algorithm for unsigned translocation distance. Algorithms and Computation: 16th International Symposium, ISAAC 2005, Proceedings. Vol. 3827 LNCS Springer Verlag, 2005. pp. 392-401 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{0b142d0e60bc464aae1402b8568e091e,

title = "A 1.75-approximation algorithm for unsigned translocation distance",

abstract = "The translocation operation is one of the popular operations for genome rearrangement. In this paper, we present a 1.75-approximation algorithm for computing unsigned translocation distance which improves upon the best known 2-approximation algorithm [1]. {\textcopyright} Springer-Verlag Berlin Heidelberg 2005.",

keywords = "Approximation algorithm, Unsigned translocation distance",

author = "Yun Cui and Lusheng Wang and Darning Zhu",

year = "2005",

doi = "10.1007/11602613\_40",

language = "English",

isbn = "3540309357",

volume = "3827 LNCS",

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

publisher = "Springer Verlag",

pages = "392--401",

booktitle = "Algorithms and Computation",

address = "Germany",

note = "16th International Symposium on Algorithms and Computation (ISAAC 2005) ; Conference date: 19-12-2005 Through 21-12-2005",

}

Cui, Y, Wang, L & Zhu, D 2005, A 1.75-approximation algorithm for unsigned translocation distance. in Algorithms and Computation: 16th International Symposium, ISAAC 2005, Proceedings. vol. 3827 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3827 LNCS, Springer Verlag, pp. 392-401, 16th International Symposium on Algorithms and Computation (ISAAC 2005), Hainan, China, 19/12/05. https://doi.org/10.1007/11602613_40

A 1.75-approximation algorithm for unsigned translocation distance. / Cui, Yun; Wang, Lusheng; Zhu, Darning.
Algorithms and Computation: 16th International Symposium, ISAAC 2005, Proceedings. Vol. 3827 LNCS Springer Verlag, 2005. p. 392-401 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3827 LNCS).

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - A 1.75-approximation algorithm for unsigned translocation distance

AU - Cui, Yun

AU - Wang, Lusheng

AU - Zhu, Darning

PY - 2005

Y1 - 2005

N2 - The translocation operation is one of the popular operations for genome rearrangement. In this paper, we present a 1.75-approximation algorithm for computing unsigned translocation distance which improves upon the best known 2-approximation algorithm [1]. © Springer-Verlag Berlin Heidelberg 2005.

AB - The translocation operation is one of the popular operations for genome rearrangement. In this paper, we present a 1.75-approximation algorithm for computing unsigned translocation distance which improves upon the best known 2-approximation algorithm [1]. © Springer-Verlag Berlin Heidelberg 2005.

KW - Approximation algorithm

KW - Unsigned translocation distance

UR - https://www.scopus.com/pages/publications/33744952700

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-33744952700&origin=recordpage

U2 - 10.1007/11602613_40

DO - 10.1007/11602613_40

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 3540309357

SN - 9783540309352

VL - 3827 LNCS

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

SP - 392

EP - 401

BT - Algorithms and Computation

PB - Springer Verlag

T2 - 16th International Symposium on Algorithms and Computation (ISAAC 2005)

Y2 - 19 December 2005 through 21 December 2005

ER -

Cui Y, Wang L, Zhu D. A 1.75-approximation algorithm for unsigned translocation distance. In Algorithms and Computation: 16th International Symposium, ISAAC 2005, Proceedings. Vol. 3827 LNCS. Springer Verlag. 2005. p. 392-401. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11602613_40

A 1.75-approximation algorithm for unsigned translocation distance

Abstract

Publication series

Conference

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this