SIGN IN
SIGN UP
On a discretizable subclass of instances of the molecular distance geometry problem
Full Text:
PDF
Buy this Article
Authors:
Carlile Lavor
State University of Campinas, Campinas-SP, Brazil
Leo Liberti
École Polytechnique, Palaiseau, France
Antonio Mucherino
École Polytechnique, Palaiseau, France
Nelson Maculan
Federal University of Rio de Janeiro, Rio de Janeiro, Brazil
2009 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 8
· Downloads (cumulative): 57
· Citation Count: 3
Published in:
· Proceeding
SAC '09
Proceedings of the 2009 ACM symposium on Applied Computing
Pages 804-805
ACM
New York, NY
, USA
©2009
table of contents
ISBN: 978-1-60558-166-8
doi>
10.1145/1529282.1529451
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
combinatorialization
combinatorics
distance geometry
experimentation
graph theory
optimization
performance
protein backbone
protein molecules
undirected weighted graph
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder