Input data (OGAMA) Info ScanGraph application is designed to work with data exported from open-source application OGAMA (www.ogama.net). The user can calculate similarity according to a regular grid or defined Areas of Interest.
In Scanpath module, OGAMA contains a tool called “Levenshtein Distance Calculation”, which is capable of computation of Levenshtein distances between participants’ trajectories.
For the use of ScanGraph application, only Subject names (1), Scanpath strings (2) and affiliation to subject groups (3) will be used.
Text file exported from OGAMA can be directly used in ScanGraph.

export
Note: Uploaded data are stored anonymously at our server and will not be used for any other purposes.
Source: table_t3.txt

Define method String-edit distance method
Info The similarity can be calculated using Levenshtein, Damerau-Levenshtein, or Needleman-Wunsch algorithm. All algorithms were modified to better work with sequences with different lengths.
Levenshtein distance algorithm counts a number of needed changes (deletion, substitution, insertion) from one sequence to another.
Damerau-Levenshtein algorithm counts a number of needed changes (deletion, substitution, insertion, transposition) from one sequence to another. Needleman-Wunsch algorithm seeks the number of identical elements of the pair of sequences.
Calculation of Needleman-Wunsch and Damerau-Levenshtein algorithms take more time, the user has to wait for the result (in some cases more than 30 seconds).
Info Using this button, the user can choose between original and collapsed fixation sequences. In collapsed sequences, there are no successive AOIs in the sequence.

Original: AAABBBCCD
Collapsed: ABCD

User defined graph Use parameter p <0,1>
Info The parameter p takes value from the interval <0,1> and represents the degree of similarity.
The higher value of p, the higher similarity of the given sequences.

Info Percent of edges takes value from the interval <0,100>. The complete graph contains 100 % of edges.
According to our experiences, the value 5 % has a very high interpretative value about the similarities.

 p     edge      %
0.89 :    1 :   0.13%
0.88 :    2 :   0.26%
0.87 :    2 :   0.26%
0.86 :    3 :   0.38%
0.85 :    3 :   0.38%
0.84 :    3 :   0.38%
0.83 :    3 :   0.38%
0.82 :    3 :   0.38%
0.81 :    3 :   0.38%
0.80 :    3 :   0.38%
0.79 :    4 :   0.51%
0.78 :    7 :   0.90%
0.77 :    8 :   1.03%
0.76 :   10 :   1.28%
0.75 :   12 :   1.54%
0.74 :   14 :   1.79%
0.73 :   20 :   2.56%
0.72 :   31 :   3.97%
0.71 :   52 :   6.67%
0.70 :   61 :   7.82%
0.69 :   67 :   8.59%
0.68 :   81 :  10.38%
0.67 :   94 :  12.05%
0.66 :  100 :  12.82%
0.65 :  106 :  13.59%
0.64 :  133 :  17.05%
0.63 :  143 :  18.33%
0.62 :  155 :  19.87%
0.61 :  164 :  21.03%
0.60 :  173 :  22.18%
0.59 :  177 :  22.69%
0.58 :  182 :  23.33%
0.57 :  193 :  24.74%
0.56 :  202 :  25.90%
0.55 :  211 :  27.05%
0.54 :  220 :  28.21%
0.53 :  226 :  28.97%
0.52 :  235 :  30.13%
0.51 :  248 :  31.79%
0.50 :  263 :  33.72%
0.49 :  270 :  34.62%
0.48 :  277 :  35.51%
0.47 :  285 :  36.54%
0.46 :  296 :  37.95%
0.45 :  304 :  38.97%
0.44 :  314 :  40.26%
0.43 :  326 :  41.79%
0.42 :  335 :  42.95%
0.41 :  348 :  44.62%
0.40 :  362 :  46.41%
0.39 :  369 :  47.31%
0.38 :  383 :  49.10%
0.37 :  391 :  50.13%
0.36 :  404 :  51.79%
0.35 :  410 :  52.56%
0.34 :  422 :  54.10%
0.33 :  436 :  55.90%
0.32 :  453 :  58.08%
0.31 :  466 :  59.74%
0.30 :  478 :  61.28%
0.29 :  493 :  63.21%
0.28 :  510 :  65.38%
0.27 :  519 :  66.54%
0.26 :  525 :  67.31%
0.25 :  529 :  67.82%
0.24 :  540 :  69.23%
0.23 :  554 :  71.03%
0.22 :  564 :  72.31%
0.21 :  573 :  73.46%
0.20 :  579 :  74.23%
0.19 :  587 :  75.26%
0.18 :  596 :  76.41%
0.17 :  604 :  77.44%
0.16 :  616 :  78.97%
0.15 :  637 :  81.67%
0.14 :  651 :  83.46%
0.13 :  662 :  84.87%
0.12 :  675 :  86.54%
0.11 :  698 :  89.49%
0.10 :  710 :  91.03%
0.09 :  721 :  92.44%
0.08 :  726 :  93.08%
0.07 :  730 :  93.59%
0.06 :  741 :  95.00%
0.05 :  754 :  96.67%
0.04 :  758 :  97.18%
0.03 :  761 :  97.56%
0.02 :  768 :  98.46%
0.01 :  780 : 100.00%
Permanent link Info The table on the left contains 100 pre-computed values of parameter p. In addition to parameter values, the number of edges is visible. The last column contains the percentage of edges from the complete graph.
The user can click into the table to display the particular graph.

By clicking to CSV icon, the user can download the table with all matrices (original matrix, modified matrix, and adjacency matrix), listed similarity groups with their character strings, input data and overview of the settings.

Click to Hyperlink icon allows creating a permanent link to the displayed graph. 
Time: 0.4151 s
Method: Levenshtein
Source: table_t3.txt
Collapsed: true
Parameter: 0.70
Edges:   61 (8%)
Edge value:  
Categories

Similar groups (31) Info Cliques with two and more vertices found in displayed graph are listed here.
After clicking on any group of similar sequences, the clique will be highlighted in the graph, and also the strings will be shown in the bottom part of the page. The user can visually inspect sequences of characters in strings.
4 E03 E10 E15 E18
4 E03 E11 E15 E18
4 E10 E15 E17 L03
3 E01 E12 L11
3 E01 L03 L11
3 E04 L10 L17
3 E05 E07 L06
3 E05 E07 L08
3 E05 E09 L08
3 E06 E19 L13
3 E09 L08 L20
3 E15 L03 L11
3 E19 L05 L13
3 E19 L07 L13
3 E19 L13 L14
3 L01 L05 L16
3 L04 L05 L13
3 L04 L13 L14
3 L05 L13 L16
3 L10 L17 L19
2 E06 E08
2 E08 L14
2 E08 L16
2 E11 E16
2 E13 E20
2 E14 E18
2 E18 L12
2 L01 L07
2 L09 L16
2 L13 L18
2 L15 L16