Skip to main content
. 2018 Mar 12;14:1176934318760543. doi: 10.1177/1176934318760543
Algorithm 1. Pseudocode of PFA in the GATK HaplotypeCaller.
1: function PFA H[], R[], Q[], α[], δ[], ζ[], m, n
2:  M0 I0 D0
3:  D0,0n1/n
4:  β0m0.9
5:  ϵ0m0.1
6:  for i1,m do
7:   for j1,n do
8:    if R [i]==H[j] then
9:     λi,jQi/3
10:   else
11:     λi,j1Qi
12:   end if
13:     Mi,jλi,j(αiMi1,j1+βiIi1,j1+βiDi1,j1)
14:     Ii,jδiMi1,j+ϵiIi1,j
15:     Di,jζiMi,j1+ϵiDi,j1
16:   end for
17:  end for
18:  return j=1n(Mm,j+Im,j)
19: end function