Results

From 2008.igem.org

(Difference between revisions)

Latest revision as of 22:42, 27 October 2008

Ranking of Models (1 – best; 4 – worst)

Primary Property Test - All models were superior.

Minimal Collision Test and Predictability Test

When random generated messages based on all 128 ascii characters occurring at equal probabilities: 1)Split 2)Twist 3) Net 4) Spoke

(Evaluation based on patterns and white space in scatter plots).

Note: Twist model’s graph results vary depending on constraints (all other models do not). Depending on constraints Twist is better than Net and Spoke, but Split is always equal or better in performance.

When random generated messages based on unequal probabilities of 128 ascii characters occurring: 1) Twist 2)Split 3) Net 4) Spoke

Note: Twist model’s graph results vary depending on constraints (all other models do not). Depending on constraints Twist is better than Split.

Overall analysis indicates that the more all characters interact with each other under a hash function, the more ideal the hash function.

Analysis of Our Models Page

Home

@@ Line 1: / Line 1: @@
+'''Ranking of Models (1 – best; 4 – worst)'''
+'''Primary Property Test''' - All models were superior.
+'''Minimal Collision Test and Predictability Test'''
+When random generated messages based on all 128 ascii characters occurring at '''equal probabilities''': 1)Split 2)Twist 3) Net 4) Spoke
+(Evaluation based on patterns and white space in scatter plots).
+Note: Twist model’s graph results vary depending on constraints (all other models do not).
+Depending on constraints Twist is better than Net and Spoke, but Split is always equal or better in performance.
+When random generated messages based on '''unequal probabilities''' of 128 ascii characters occurring:
+) Twist 2)Split 3) Net 4) Spoke
+Note: Twist model’s graph results vary depending on constraints (all other models do not). Depending on constraints Twist is better than Split.
+'''Overall analysis indicates that the more all characters interact with each other under a hash function, the more ideal the hash function.'''
 *[https://2008.igem.org/Analysis_of_Our_Models Analysis of Our Models Page]
 *[https://2008.igem.org/Team:Davidson-Missouri_Western Home]