Skip to main content

Table 11 For each read and its counterpart, we find the number of unique candidate positions found for given seeds and the number of positions having the maximum number of matches with the read

From: PerFSeeB: designing long high-weight single spaced seeds for full sensitivity alignment with a given number of mismatches

 

\(S_1\)

\(\overline{S_3}\)

\(N_2\)

\(N_3\)

\(N_4\)

Percentage of reads having at least given number of matches

95

96.49413

96.55955

95.88331

96.41693

96.54956

96

96.23315

96.26387

95.77562

96.20613

96.26404

97

95.81032

95.81777

95.56522

95.81777

95.81777

98

94.98875

94.98875

94.98875

94.98875

94.98875

99

92.66636

92.66636

92.66636

92.66636

92.66636

100

81.17036

81.17036

81.17036

81.17036

81.17036

Total number of positions having the maximum number of matches

95

24,673

30,124

5,743

18,078

29,184

96

88,548

95,152

28,715

76,571

96,154

97

271,116

272,204

165,624

272,204

272,204

98

1,072,182

1,072,182

1,072,182

1,072,182

1,072,182

99

6,505,597

6,505,597

6,505,597

6,505,597

6,505,597

100

52,432,760

52,432,760

52,432,760

52,432,760

52,432,760

Total number of candidate positions to be checked

95

2,999,321

7,694,425

62,080

534,856

5,075,260

96

6,484,344

15,560,907

183,070

1,785,944

10,215,791

97

16,738,989

35,342,085

975,884

6,106,930

23,375,078

98

49,957,296

94,777,228

6,591,836

22,966,268

66,288,831

99

206,562,418

374,668,653

42,466,387

101,753,217

268,804,889

100

1,140,090,415

1,980,598,089

306,980,283

593,471,736

1,467,713,805

Averaged ratio of candidate positions to best positions

95

334.88

790.87

10.37

50.87

535.79

96

414.02

1039.40

7.57

100.63

677.69

97

493.92

1164.11

14.72

115.13

744.46

98

486.19

1087.47

22.87

137.82

704.10

99

465.90

1001.87

31.37

140.65

662.25

100

412.66

848.60

38.46

137.69

575.35

  1. (a) Percentage of reads attaining at least a given number of matches (higher values are better). (b) The total number of positions attaining the maximum number of matches (we add up numbers for all reads, higher values are better). (c) The total number of candidate positions to be checked (smaller values are better). (d) For each read attaining the given number of matches, we find the ratio of all candidate positions to the number of best positions (averaged; smaller values are better)