An improved algorithm to enumerate all traces that sort a signed permutation by reversals

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Christian Baudet INRIA Grenoble Rhône-Alpes, Laboratoire de Biométrie et Biologie Évolutive, Villeurbanne Cedex, France
Zanoni Dias University of Campinas -- Unicamp, Av. Albert Einstein, Cidade Universitaria, CEP, Campinas -- São Paulo -- Brazil
Published in:
Cover Image
 
· Proceeding
SAC '10 Proceedings of the 2010 ACM Symposium on Applied Computing
Pages 1521-1525
ACM New York, NY, USA ©2010
table of contents ISBN: 978-1-60558-639-7 doi>10.1145/1774088.1774416
An improved algorithm to enumerate all traces that sort a signed permutation by reversals Published by ACM 2010 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 15
· Downloads (cumulative): 76
· Citation Count: 3


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


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

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder