Skip to main content
SpringerLink
Log in

A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study

  • Conference paper
  • First Online:
Algorithms and Data Structures (WADS 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2125))

Included in the following conference series:

Abstract

Hannenhalli and Pevzner gave the first polynomial-time algorithm for computing the inversion distance between two signed permutations, as part of the larger task of determining the shortest sequence of inversions needed to transform one permutation into the other. Their algorithm (restricted to distance calculation) proceeds in two stages: in the first stage, the overlap graph induced by the permutation is decomposed into connected components, then in the second stage certain graph structures (hurdles and others) are identified. Berman and Hannenhalli avoided the explicit computation of the overlap graph and gavean O(na(n)) algorithm, based on a Union-Find structure, to find its connected components, where a is the inverse Ackerman function. Since for all practical purposes a(n) is a constant no larger than four, this algorithm has been the fastest practical algorithm to date. In this paper, we present a new linear-time algorithm for computing the connected components, which is more efficient than that of Berman and Hannenhalli in both theory and practice. Our algorithm uses only a stack and is very easy to implement. We give the results of computational experiments over a large range of permutation pairs produced through simulated evolution; our experiments show a speed-up by a factor of 2 to 5 in the computation of the connected components and by a factor of 1.3 to 2 in the overall distance computation.

Supported in part by NSF Grants CAREER 00-93039, NSF ITR 00-81404 and NSF DEB 99-10123 and by DOE SUNAPP AX-3006 and DOE-CSRI-14968.

Supported in part by NSF Grant ITR 00-81404.

Supported by the UNM Albuquerque High Performance Computing Center.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V. Bafna and P. Pevzner. Sorting permutations by transpositions. In Proceedings of the 6th Annual Symposium on Discrete Algorithms, pages 614–623, New York, January 1995. ACM Press.

    Google Scholar 

  2. V. Bafna and P. A. Pevzner. Genome rearrangements and sorting by reversals. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science (FOCS93), pages 148–157. IEEE Press, 1993.

    Google Scholar 

  3. V. Bafna and P. A. Pevzner. Genome rearrangements and sorting by reversals. SIAM Journal on Computing, 25:272–289, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  4. V. Bafna and P. A. Pevzner. Sorting by transpositions. SIAM Journal on Discrete Mathematics, 11:224–240, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  5. P. Berman and S. Hannenhalli. Fast Sorting by Reversal. In D.S. Hirschberg and E.W. Myers, editors, Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching, pages 168–185, Laguna Beach, CA, June 1996. Lecture Notes in Computer Science, 1075, Springer-Verlag.

    Google Scholar 

  6. M. Blanchette, G. Bourque, and D. Sankoff. Breakpoint phylogenies. In S. Miyano and T. Takagi, editors, Genome Informatics, pages 25–34. University Academy Press, Tokyo, Japan, 1997.

    Google Scholar 

  7. A. Caprara. Sorting by reversals is difficult. In Proceedings of the 1st Conference on Computational Molecular Biology (RECOMB97), pages 75–83, Santa Fe, NM, 1997. ACM Press.

    Google Scholar 

  8. A. Caprara. Sorting permutations by reversals and Eulerian cycle decompositions. SIAM J. Discrete Math., 12(1):91–110, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  9. M.E. Cosner, R.K. Jansen, B.M.E. Moret, L.A. Raubeson, L.-S. Wang, T. Warnow, and S. Wyman. A new fast heuristic for computing the breakpoint phylogeny and experimental phylogenetic analyses of real and synthetic data. In Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology (ISMB00), pages 104–115, San Diego, CA, 2000.

    Google Scholar 

  10. S. Hannenhalli. Software for computing inversion distances between signed gene orders. Department of Mathematics, University of Southern California, URL. http://www-hto.usc.edu/plain/people/Hannenhalli.html.

  11. S. Hannenhalli and P.A. Pevzner. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). In Proceedings of the 27th Annual Symposium on Theory of Computing (STOC95), pages 178–189, Las Vegas, NV, 1995. ACM Press.

    Google Scholar 

  12. H. Kaplan, R. Shamir, and R.E. Tarjan. A faster and simpler algorithm for sorting signed permutations by reversals. SIAM Journal of Computing, 29(3):880–892, 1999. First appeared in Proceedings of the 8th Annual Symposium on Discrete Algorithms (SODA97), 344-351, New Orleans, LA. ACM Press.

    Article  MathSciNet  Google Scholar 

  13. I. Mantin and R. Shamir. Genome Rearrangement Algorithm Applet: An algorithm for sorting signed permutations by reversals. http://www.math.tau.ac.il/~rshamir/GR/, 1999.

  14. C.C. McGeoch. Toward an experimental method for algorithm simulation. INFORMS Journal of Computing, 8:1–15, 1996.

    MATH  Google Scholar 

  15. B. M.E. Moret, S. Wyman, D.A. Bader, T. Warnow, and M. Yan. A new implementation and detailed study of breakpoint analysis. In Proceedings of the 6th Pacific Symposium on Biocomputing (PSB2001), pages 583–594, Big Island, HI, January 2001.

    Google Scholar 

  16. B.M.E. Moret. Towards a discipline of experimental algorithmics.In DIMACS Monographs in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 2001.To appear. Available at http://www.cs.unm.edu/~moret/dimacs.ps.

  17. J.H. Nadeau and B.A. Taylor. Lengths of chromosome segments conserved since divergence of man and mouse. In Proceedings of the National Academy of Sciences, volume 81, pages 814–818, 1984.

    Article  Google Scholar 

  18. R.G. Olmstead and J.D. Palmer. Chloroplast DNA systematics: a review of methods and data analysis. American Journal of Botany, 81:1205–1224, 1994.

    Article  Google Scholar 

  19. J.D. Palmer. Chloroplast and mitochondrial genome evolution in land plants. In R. Herrmann, editor, Cell Organelles, pages 99–133. Springer Verlag, 1992.

    Google Scholar 

  20. L.A. Raubeson and R.K. Jansen. Chloroplast DNA evidence on the ancient evolutionary split in vascular land plants. Science, 255:1697–1699, 1992.

    Article  Google Scholar 

  21. D. Sankoff and M. Blanchette. Multiple genome rearrangement and breakpoint phylogeny. Journal of Computational Biology, 5:555–570, 1998.

    Article  Google Scholar 

  22. J.C. Setubal and J. Meidanis. Introduction to Computational Molecular Biology. PWS, Boston, MA, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of New Mexico, Albuquerque, NM, 87131, USA

    David A. Bader & Mi Yan

  2. Department of Computer Science, University of New Mexico, Albuquerque, NM, 87131, USA

    Bernard M. E. Moret

Authors
  1. David A. Bader
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bernard M. E. Moret
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mi Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Candada, K1S 5B6

    Frank Dehne  & Jörg-Rüdiger Sack  & 

  2. Center for Geometric Computing, Brown University, Providence, RI, 02912-1910, USA

    Roberto Tamassia

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bader, D.A., Moret, B.M.E., Yan, M. (2001). A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study. In: Dehne, F., Sack, JR., Tamassia, R. (eds) Algorithms and Data Structures. WADS 2001. Lecture Notes in Computer Science, vol 2125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44634-6_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-44634-6_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42423-9

  • Online ISBN: 978-3-540-44634-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation