Revision 282 - (view) (annotate) - [select for diffs]
Modified Tue Aug 14 16:15:59 2007 UTC (17 years, 1 month ago) by duarte
File length: 2112 byte(s)
Diff to previous 250

Made get_graph a bit less memory hungry, by using a float[][] instead of double[][]
Not printing warnings about missing atoms anymore

Revision 250 - (view) (annotate) - [select for diffs]
Modified Mon Aug 6 14:48:37 2007 UTC (17 years, 1 month ago) by stehr
File length: 2085 byte(s)
Diff to previous 228

added application to count grid density, suppressed warning for secondary structure reassignment

Revision 228 - (view) (annotate) - [select for diffs]
Modified Mon Jul 9 14:32:47 2007 UTC (17 years, 2 months ago) by duarte
File length: 1983 byte(s)
Diff to previous 226

Now can do crossed contacts also with geometric hashing
Renamed getGraphGeometricHashing to get_graph (so interface remains as it was before we introduced the geometric hashing)

Revision 226 - (view) (annotate) - [select for diffs]
Added Fri Jul 6 13:43:30 2007 UTC (17 years, 2 months ago) by duarte
File length: 1420 byte(s)

First geometric hashing implementation for calculating graph (with new class Box). Only does non-crossed cts
Geometrich hashing graph calculation kept in a separate method than normal get_graph. Still either of the methods can be used.
Using javax.vectormath objects for the vectors (distance method also from that)
Using TreeMap for get_coords_for_ct