Dr David McGrath
Spine Physician
MB BS (Hons) FAFOM, RACP, FAFMMMaster of Pain Medicine
Algorithm:
Notation: 2@3@4@1=2@(341)
1. Note the first triple
2. Replace all following triples by symbols according to: [@1,2 with x] and [@3,4 with z]
3. The destination class is solely determined by the first and last triple.To determine destination triple class, use rules from table.
Note: (1,2) maps to (1,2) and (3,4) maps to (3,4) therefore triples always stay in their subclass.
| First Triple | Last Triple (3,1) | Last Triple (4,2) |
| 1,2@(...) | 1,3 =1 (1,2@3=1) and (1,2@1=1) | 2,4=2 (1,2@4=2) and (1,2@2=2) |
| 3,4@(....) | 1,3=3 (3,4@1=3 ) and (3,4@3=3) | 2,4=4 (3,4@2=4 ) and (3,4@4=4) |
eg 4@(1232)=4y*(xxzx) 3@(24312)=4y*(xzzxx) eg 2@(3)=1y*(z) 3@(2)=4y*(x)
4. Final Destination Rule.
(a) Destination triple has same parity as last triple.
(b) The destination triple must belong to same set as initial triple. (1,2) or (3,4)
| Final | Last | First | Last | Final |
| 2 | 2,4 | 1,2 | 1,3 | 1 |
| 4 | 2,4 | 3,4 | 1,3 | 3 |
©Copyright 2007 Dr David McGrath. All rights reserved