101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Giuseppe Lancia Celera Genomics, Rockville, MD and D.E.I., University of Padova
Robert Carr Sandia National Labs, Albuquerque, NM
Brian Walenz Celera Genomics, Rockville, MD
Sorin Istrail Celera Genomics, Rockville, MD
101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem Published by ACM 2001 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 23
· Downloads (cumulative): 471
· Citation Count: 22

Published in:
Cover Image
 
· Proceeding
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
Pages 193-202
ACM New York, NY, USA ©2001
table of contents ISBN:1-58113-353-7 doi>10.1145/369133.369199

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