Read/MPLen(nt) | Short.Path(%)a | Usable(%)b | Compl.Red(%)c |
---|
100/400 | 99.96 | 0.48 | 57.97 |
100/8000 | 95.85 | 2.69 | 60.13 |
100/35000 | 84.60 | 6.55 | 58.27 |
35/400 | 99.5 | 1.06 | 35.87 |
35/8000 | 87.84 | 6.77 | 33.66 |
35/35000 | 62.29 | 10.78 | 31.62 |
- A table summarizing average (mean) statistics across 391 prokaryotic genomes (see Additional file 1) when applying 50,000 mate-pairs of a particular length to a graph constructed from k-mers of a particular length. aPercentage of mate-pairs that can be mapped to a shortest path in the graph when comparing exact length of the insert to length of the path. bPercentage of mate-pairs that can ultimately provide unambiguous information for repeat resolution (see Methods on repeat resolution). cPercent reduction in finishing effort (see Methods on finishing complexity) that the set of mate-pairs can provide.