Skip to main content

Table 2 All four graphs have multiple weakly connected components

From: Co-linear chaining on pangenome graphs

Graph

Size of path cover (min–max)

Number of anchors

Number of iterations

Array last2reach

Array D

Chaining

Mean/Max

Mean/Max

Mean/Max

Mean/Max

10H

1–20

10.9 k/309.6 k

2.0/4

2.0/5

2.3/77

40H

1–36

10.9 k/309.6 k

2.0/4

2.0/5

2.4/72

80H

1–49

10.8 k/309.4 k

3.0/4

3.0/5

2.4/61

95H

1–59

10.8 k/309.4 k

3.0/4

3.0/5

2.4/64

  1. Therefore, the size of the identified path cover of each graph is presented as a range. The other columns show the count of iterations used by our iterative algorithms for graph preprocessing and co-linear chaining (Algorithms 1, 2, 3). The iteration count statistics were gathered while aligning simulated long reads to cyclic pangenome graphs
Back to article page

Algorithms for Molecular Biology

ISSN: 1748-7188