Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
98
Voted
RECOMB
2003
Springer
111
views
Computational Biology
»
more
RECOMB 2003
»
A complete and effective move set for simplified protein folding
16 years 3 months ago
Download
www.cs.mcgill.ca
Neal Lesh, Michael Mitzenmacher, Sue Whitesides
Real-time Traffic
Computational Biology
|
RECOMB 2003
|
Simplified Protein Folding
|
claim paper
Related Content
»
CPSPtools Exact and complete algorithms for highthroughput 3D lattice protein studies
»
A hybrid approach to protein folding problem integrating constraint programming with local...
»
A novel functional module detection algorithm for proteinprotein interaction networks
more »
Post Info
More Details (n/a)
Added
03 Dec 2009
Updated
03 Dec 2009
Type
Conference
Year
2003
Where
RECOMB
Authors
Neal Lesh, Michael Mitzenmacher, Sue Whitesides
Comments
(0)
Researcher Info
Computational Biology Study Group
Computer Vision