CSC 181: Data Comparisons
This page lists a comparison of outputs obtained from software implementations of the algorithms mentioned in the abstract. We compare the running time of the algorithms with respect to the number of input atoms. Start with moving your packages to the ARCiB server and use a fixed set of .PDB files selected at random from http://www.rcsb.org/.

 

 

 

Petko:

HULL : summary | graph | results
MSMS : summary | graph | results
VEGA: summary | graph | results

*note: The independent variable (x) is the number of atoms,
The dependent variable (y) is the execution time of the program.

Vince:

View results for the Double Cubing Latice Method:

Overview of the Double Cubing Latice Method
Slides for project presentation

Parag:


Here are some of my results using DMS:
  • Table of results
  • Graph_Overview
  • Graph
  • Here are some of my results using MASKER:
  • Table of results
  • Graph_Overview
  • Graph
  • Rohit:

     

    using VEGA: O(x^2) complexity

    curve fitting
    Initial graph

    Peter:

    Daniel:

     

    Table of results