ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Faster and simpler algorithm for sorting signed permutations by reversals
Full text PdfPdf (125 KB)
Source Annual Conference on Research in Computational Molecular Biology archive
Proceedings of the first annual international conference on Computational molecular biology table of contents
Santa Fe, New Mexico, United States
Page: 163  
Year of Publication: 1997
ISBN:0-89791-882-7
Authors
Haim Kaplan  Dept. of Computer Science, Princeton University, Princeton, NJ and NEC Institute, Princeton
Ron Shamir  Dept. of Computer Science, Sackler Faculty of Exact Sciences, Tel Aviv University, Tel-Aviv 69978 Israel
Robert E. Tarjan  Dept. of Computer Science, Princeton University, Princeton, NJ and NEC Institute, Princeton
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
DOE : Department of Energy
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 22,   Citation Count: 1
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/267521.267544
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Piotr Berman , Sridhar Hannenhalli, Fast Sorting by Reversal, Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching, p.168-185, June 10-12, 1996
2
Sridhar Hannenhalli , Pavel Pevzner, Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, p.178-189, May 29-June 01, 1995, Las Vegas, Nevada, United States  [doi>10.1145/225058.225112]

CITED BY
Tommaso Schiavinotto , Thomas Stützle, A review of metrics on permutations for search landscape analysis, Computers and Operations Research, v.34 n.10, p.3143-3153, October, 2007

INDEX TERMS

Primary Classification:
  J. Computer Applications
  J.3 LIFE AND MEDICAL SCIENCES
      Subjects: Biology and genetics

Additional Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.1 Combinatorics
          Subjects: Permutations and combinations
  G.4 MATHEMATICAL SOFTWARE
      Subjects: Algorithm design and analysis


General Terms:
Algorithms, Design, Human Factors, Performance, Theory

Collaborative Colleagues:
Haim Kaplan: colleagues
Ron Shamir: colleagues
Robert E. Tarjan: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player