Faster and simpler algorithm for sorting signed permutations by reversals

Haim Kaplan; Ron Shamir; Robert E. Tarjan

doi:10.1145/267521.267544

Faster and simpler algorithm for sorting signed permutations by reversals

Haim Kaplan^*, Ron Shamir, Robert E. Tarjan

^*Corresponding author for this work

Princeton University

Research output: Contribution to conference › Paper › peer-review

3 Scopus citations

Abstract

We give a quadratic algorithm for finding the minimum number of reversals needed to sort a signed permutation. Our algorithm is faster than the previous algorithm of Hannenhalli and Pevzner and its faster implementation of Berman and Hannenhalli. The algorithm is conceptually simple and does not require special data structures. Our study also considerably simplifies the combinatorial structures used by the analysis.

Original language	English
Pages	163
Number of pages	1
DOIs	https://doi.org/10.1145/267521.267544
State	Published - 1997
Externally published	Yes
Event	Proceedings of the 1997 1st Annual International Conference on Computational Molecular Biology, RECOMB - Santa Fe, NM, USA Duration: 20 Jan 1997 → 23 Jan 1997

Conference

Conference	Proceedings of the 1997 1st Annual International Conference on Computational Molecular Biology, RECOMB
City	Santa Fe, NM, USA
Period	20/01/97 → 23/01/97

Access to Document

10.1145/267521.267544

Cite this

@conference{42810c4d38ec4043970e98929c041475,

title = "Faster and simpler algorithm for sorting signed permutations by reversals",

abstract = "We give a quadratic algorithm for finding the minimum number of reversals needed to sort a signed permutation. Our algorithm is faster than the previous algorithm of Hannenhalli and Pevzner and its faster implementation of Berman and Hannenhalli. The algorithm is conceptually simple and does not require special data structures. Our study also considerably simplifies the combinatorial structures used by the analysis.",

author = "Haim Kaplan and Ron Shamir and Tarjan, {Robert E.}",

year = "1997",

doi = "10.1145/267521.267544",

language = "אנגלית",

pages = "163",

note = "Proceedings of the 1997 1st Annual International Conference on Computational Molecular Biology, RECOMB ; Conference date: 20-01-1997 Through 23-01-1997",

}

TY - CONF

T1 - Faster and simpler algorithm for sorting signed permutations by reversals

AU - Kaplan, Haim

AU - Shamir, Ron

AU - Tarjan, Robert E.

PY - 1997

Y1 - 1997

N2 - We give a quadratic algorithm for finding the minimum number of reversals needed to sort a signed permutation. Our algorithm is faster than the previous algorithm of Hannenhalli and Pevzner and its faster implementation of Berman and Hannenhalli. The algorithm is conceptually simple and does not require special data structures. Our study also considerably simplifies the combinatorial structures used by the analysis.

AB - We give a quadratic algorithm for finding the minimum number of reversals needed to sort a signed permutation. Our algorithm is faster than the previous algorithm of Hannenhalli and Pevzner and its faster implementation of Berman and Hannenhalli. The algorithm is conceptually simple and does not require special data structures. Our study also considerably simplifies the combinatorial structures used by the analysis.

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

U2 - 10.1145/267521.267544

DO - 10.1145/267521.267544

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:0030679148

SP - 163

T2 - Proceedings of the 1997 1st Annual International Conference on Computational Molecular Biology, RECOMB

Y2 - 20 January 1997 through 23 January 1997

ER -

Faster and simpler algorithm for sorting signed permutations by reversals

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this