Algorithm 1: Filter Recruited Reads that Are Located at Highly Covered Regions |
Input: recruited reads R Output: qualified reads Q
-
1
Allocate and initialize array of all recruited reads
-
2
for
i = 1, 2, …, R
do
-
3
l = locus of each read Ri
-
4
D(l) = dictionary of coverage at each locus l
-
5
D(l)++
-
6
end
-
7
M = MeanValue(D)
-
8
SD = StandardDeviation(D)
-
9
for
l = 1, 2,.., D
do
-
10
F = dictionary of unqualified loci on the genome
-
11
if D(l) <= M + 2*SD then
-
12
F(l) = true
-
13
else
-
14
F(l) = false
-
15
end
-
16
for
i = 1, 2, …, R
do
-
17
l = locus of each read Ri
-
18
if
F(l) == true then
-
19
add Ri to Q
-
20
end
-
21
end
|