Skip to main content
SpringerLink
Log in

Experiments in Computing Sequences of Reversals

  • Conference paper
  • First Online:
Book cover Algorithms in Bioinformatics (WABI 2001)

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

Included in the following conference series:

Abstract

This paper discusses a bit-vector implementation of an algorithm that computes an optimal sequence of reversals that sorts a signed permutation. The main characteristics of the implementation are its simplicity, both in terms of data structures and operations, and the fact that it exploits the parallelism of bitwise logical operations.

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. David Bader, Bernard Moret, Mi Yan, A Linear-Time Algorithm for Computing Inversion Distance Between Signed Permutations with an Experiemntal Study. Proc. 7th Workshop on Algs. and Data Structs. WADS01, Providence (2001), to appear in Lecture Notes in Computer Science, Springer Verlag.

    Google Scholar 

  2. Anne Bergeron, A Very Elementary Presentation of the Hannenhalli-Pevzner Theory. CPM 2001, Jerusalem (2001), to appear in Lecture Notes in Computer Science, Springer Verlag.

    Google Scholar 

  3. Piotr Berman and Sridhar Hannenhalli, Fast Sorting by Reversal. CPM 1996, LNCS 1075: 168–185 (1996).

    Google Scholar 

  4. Alberto Caprara, Sorting by reversals is difficult. RECOMB 1997, ACM Press: 75–83 (1997).

    Google Scholar 

  5. Sridhar Hannenhalli and Pavel Pevzner, Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals. JACM 46(1): 1–27 (1999).

    Article  MATH  MathSciNet  Google Scholar 

  6. John Kececioglu and David Sankoff, Efficient bounds for oriented chromosome-inversion distance. CPM 1994, LNCS 807: 307–325 (1994).

    Google Scholar 

  7. Haim Kaplan, Ron Shamir, Robert Tarjan, A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. SIAM J. Comput. 29(3): 880–892 (1999).

    Article  MathSciNet  Google Scholar 

  8. Pavel Pevzner, Computational Molecular Biology, MIT Press, Cambridge, Mass., 314 pp. (2000).

    MATH  Google Scholar 

  9. David Sankoff, Edit Distances for Genome Comparisons Based on Non-Local Operations. CPM 1992, LNCS 644: 121–135 (1992).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LACIM, Université du Québec à Montréal, C.P. 8888 Succ. Centre-Ville, Montréal, Québec, Canada, H3C 3P8

    Anne Bergeron & François Strasbourg

Authors
  1. Anne Bergeron
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. François Strasbourg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LIRMM, 161 rue Ada, 34392, Montpellier, France

    Olivier Gascuel

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

    Bernard M. E. Moret

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bergeron, A., Strasbourg, F. (2001). Experiments in Computing Sequences of Reversals. In: Gascuel, O., Moret, B.M.E. (eds) Algorithms in Bioinformatics. WABI 2001. Lecture Notes in Computer Science, vol 2149. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44696-6_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-44696-6_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42516-8

  • Online ISBN: 978-3-540-44696-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation