From: A graph theoretic approach to utilizing protein structure to identify non-random somatic mutations
Close vs. Far | Method | ||
---|---|---|---|
Residue distance | GraphPAC- Cheapest | GraphPAC- Farthest | GraphPAC- Nearest |
<5 Ã… vs >25Ã… | 9.50 E-143 | 2.10 E-141 | 1.38 E-145 |
<10 Ã… vs >30Ã… | 9.32 E-147 | 5.82 E-145 | 2.81 E-149 |
<15 Ã… vs >35Ã… | 2.91 E-151 | 1.01 E-148 | 1.33 E-153 |
<20 Ã… vs >40Ã… | 1.42 E-155 | 1.63 E-151 | 7.15 E-158 |