On the complexity and approximation of syntenic distance

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: B. DasGupta Department of Computer Science, Rutgers University, Camden, NJ
T. Jiang Department of Computer Science, McMaster University, Hamilton, Ontario L8S 4K1, Canada
S. Kannan Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA
M. Li Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong
Z. Sweedyk Department of Computer and Information Sciences, University of Pennsylvania, Philadelphia, PA
On the complexity and approximation of syntenic distance Published by ACM 1997 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 2
· Downloads (cumulative): 206
· Citation Count: 1

Published in:
Cover Image
 
· Proceeding
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Pages 99-108
ACM New York, NY, USA ©1997
table of contents ISBN:0-89791-882-7 doi>10.1145/267521.267536

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