Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

RECOMB
2001
Springer

favoriteEmaildiscussreport

136views Computational Biology» more RECOMB 2001»

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

14 years 4 months ago

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

Download www.cs.brown.edu

Giuseppe Lancia, Robert D. Carr, Brian Walenz, Sor

Real-time Traffic

Computational Biology | Maximum Contact Map | Optimal Pdb Structure | RECOMB 2001 |

claim paper

Related Content

» A simple and fast heuristic for protein structure comparison

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2001
Where	RECOMB
Authors	Giuseppe Lancia, Robert D. Carr, Brian Walenz, Sorin Istrail

Comments (0)