Sequencing-by-hybridization at the information-theory bound: an optimal algorithm

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Franco P. Preparata Computer Science Department, Brown University, 115 Waterman Street, Providence, RI
Eli Upfal Computer Science Department, Brown University, 115 Waterman Street, Providence, RI
Published in:
· Proceeding
RECOMB '00 Proceedings of the fourth annual international conference on Computational molecular biology
Pages 245-253
ACM New York, NY, USA ©2000
table of contents ISBN:1-58113-186-0 doi>10.1145/332306.332562
Sequencing-by-hybridization at the information-theory bound: an optimal algorithm Published by ACM 2000 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 3
· Downloads (cumulative): 217
· Citation Count: 9


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