Fast sorting by reversal

Piotr Berman, Sridhar Hannenhalli

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    87 Citations (Scopus)

    Abstract

    Analysis of genomes evolving by inversions leads to a combinatorial problem of sorting by reversals studied in detail recently. Following a series of work recently, Hannenhalli and Pevzner developed the first polynomial algorithm for the problem of sorting signed permutations by reversals and proposed an O(n4) implementation of the algorithm. In this paper we exploit a few combinatorial properties of the cycle graph of a permutation and propose an O(n2α(n)) implementation of the algorithm where a is the inverse Ackerman function. Besides making this algorithm practical, our technique improves implementations of the other rearrangement distance problems.

    Original languageEnglish (US)
    Title of host publicationCombinatorial Pattern Matching - 7th Annual Symposium, CPM 1996, Proceedings
    EditorsGene Myers, Dan Hirschberg
    PublisherSpringer Verlag
    Pages168-185
    Number of pages18
    ISBN (Print)3540612580, 9783540612582
    DOIs
    StatePublished - Jan 1 1996
    Event7th Annual Symposium on Combinatorial Pattern Matching, CPM 1996 - Laguna Beach, United States
    Duration: Jun 10 1996Jun 12 1996

    Publication series

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

    Other

    Other7th Annual Symposium on Combinatorial Pattern Matching, CPM 1996
    CountryUnited States
    CityLaguna Beach
    Period6/10/966/12/96

    Fingerprint

    Reversal
    Sorting
    Ackerman's function
    Signed Permutations
    Inverse function
    Polynomial Algorithm
    Combinatorial Problems
    Rearrangement
    Inversion
    Permutation
    Genome
    Cycle
    Series
    Genes
    Polynomials
    Graph in graph theory

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    Berman, P., & Hannenhalli, S. (1996). Fast sorting by reversal. In G. Myers, & D. Hirschberg (Eds.), Combinatorial Pattern Matching - 7th Annual Symposium, CPM 1996, Proceedings (pp. 168-185). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1075). Springer Verlag. https://doi.org/10.1007/3-540-61258-0_14
    Berman, Piotr ; Hannenhalli, Sridhar. / Fast sorting by reversal. Combinatorial Pattern Matching - 7th Annual Symposium, CPM 1996, Proceedings. editor / Gene Myers ; Dan Hirschberg. Springer Verlag, 1996. pp. 168-185 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{dcba0d2f351b49709768612a3288de03,
    title = "Fast sorting by reversal",
    abstract = "Analysis of genomes evolving by inversions leads to a combinatorial problem of sorting by reversals studied in detail recently. Following a series of work recently, Hannenhalli and Pevzner developed the first polynomial algorithm for the problem of sorting signed permutations by reversals and proposed an O(n4) implementation of the algorithm. In this paper we exploit a few combinatorial properties of the cycle graph of a permutation and propose an O(n2α(n)) implementation of the algorithm where a is the inverse Ackerman function. Besides making this algorithm practical, our technique improves implementations of the other rearrangement distance problems.",
    author = "Piotr Berman and Sridhar Hannenhalli",
    year = "1996",
    month = "1",
    day = "1",
    doi = "10.1007/3-540-61258-0_14",
    language = "English (US)",
    isbn = "3540612580",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "168--185",
    editor = "Gene Myers and Dan Hirschberg",
    booktitle = "Combinatorial Pattern Matching - 7th Annual Symposium, CPM 1996, Proceedings",
    address = "Germany",

    }

    Berman, P & Hannenhalli, S 1996, Fast sorting by reversal. in G Myers & D Hirschberg (eds), Combinatorial Pattern Matching - 7th Annual Symposium, CPM 1996, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1075, Springer Verlag, pp. 168-185, 7th Annual Symposium on Combinatorial Pattern Matching, CPM 1996, Laguna Beach, United States, 6/10/96. https://doi.org/10.1007/3-540-61258-0_14

    Fast sorting by reversal. / Berman, Piotr; Hannenhalli, Sridhar.

    Combinatorial Pattern Matching - 7th Annual Symposium, CPM 1996, Proceedings. ed. / Gene Myers; Dan Hirschberg. Springer Verlag, 1996. p. 168-185 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1075).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    TY - GEN

    T1 - Fast sorting by reversal

    AU - Berman, Piotr

    AU - Hannenhalli, Sridhar

    PY - 1996/1/1

    Y1 - 1996/1/1

    N2 - Analysis of genomes evolving by inversions leads to a combinatorial problem of sorting by reversals studied in detail recently. Following a series of work recently, Hannenhalli and Pevzner developed the first polynomial algorithm for the problem of sorting signed permutations by reversals and proposed an O(n4) implementation of the algorithm. In this paper we exploit a few combinatorial properties of the cycle graph of a permutation and propose an O(n2α(n)) implementation of the algorithm where a is the inverse Ackerman function. Besides making this algorithm practical, our technique improves implementations of the other rearrangement distance problems.

    AB - Analysis of genomes evolving by inversions leads to a combinatorial problem of sorting by reversals studied in detail recently. Following a series of work recently, Hannenhalli and Pevzner developed the first polynomial algorithm for the problem of sorting signed permutations by reversals and proposed an O(n4) implementation of the algorithm. In this paper we exploit a few combinatorial properties of the cycle graph of a permutation and propose an O(n2α(n)) implementation of the algorithm where a is the inverse Ackerman function. Besides making this algorithm practical, our technique improves implementations of the other rearrangement distance problems.

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

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

    U2 - 10.1007/3-540-61258-0_14

    DO - 10.1007/3-540-61258-0_14

    M3 - Conference contribution

    SN - 3540612580

    SN - 9783540612582

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

    SP - 168

    EP - 185

    BT - Combinatorial Pattern Matching - 7th Annual Symposium, CPM 1996, Proceedings

    A2 - Myers, Gene

    A2 - Hirschberg, Dan

    PB - Springer Verlag

    ER -

    Berman P, Hannenhalli S. Fast sorting by reversal. In Myers G, Hirschberg D, editors, Combinatorial Pattern Matching - 7th Annual Symposium, CPM 1996, Proceedings. Springer Verlag. 1996. p. 168-185. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-61258-0_14