Faster and simpler algorithm for sorting signed permutations by reversals

Haim Kaplan; Ron Shamir; Robert E. Tarjan

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

64 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	344-351
Number of pages	8
State	Published - 1997
Externally published	Yes
Event	Proceedings of the 1996 8th Annual ACM-SIAM Symposium on Discrete Algorithms - New Orleans, LA, USA Duration: 5 Jan 1997 → 7 Jan 1997

Conference

Conference	Proceedings of the 1996 8th Annual ACM-SIAM Symposium on Discrete Algorithms
City	New Orleans, LA, USA
Period	5/01/97 → 7/01/97

Cite this

@conference{5edc4a0b89224c8887534e7906ecc8ab,

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",

language = "אנגלית",

pages = "344--351",

note = "Proceedings of the 1996 8th Annual ACM-SIAM Symposium on Discrete Algorithms ; Conference date: 05-01-1997 Through 07-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=0030735997&partnerID=8YFLogxK

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

AN - SCOPUS:0030735997

SP - 344

EP - 351

T2 - Proceedings of the 1996 8th Annual ACM-SIAM Symposium on Discrete Algorithms

Y2 - 5 January 1997 through 7 January 1997

ER -

Faster and simpler algorithm for sorting signed permutations by reversals

Abstract

Conference

Other files and links

Fingerprint

Cite this