Completeness comparison

Completeness comparison

Source publication
Article
Full-text available
It is a challenge to assemble an enormous amount of metagenome data in metagenomics. Usually, metagenome cluster sequence before assembly accelerates the whole process. In SpaRC, sequences are defined as nodes and clustered by a parallel label propagation algorithm (LPA). To address the randomness of label selection from the parallel LPA during clu...

Context in source publication

Context 1
... data show that although three of the ten most significant clusters in the LPA have higher purity than the PLDLS, the overall purity of the clusters in the PLDLS is higher. The specific results are shown in Fig. 8. Table 3 shows the completeness of the four algorithms on the three datasets. The results show that the median and average completeness metrics of PLDLS on the three datasets are significantly higher than the other algorithms by about 25-60%. ...

Similar publications

Article
Full-text available
Metagenomics has enabled the comprehensive study of microbiomes. However, many applications would benefit from a method that sequences specific bacterial taxa of interest, but not most background taxa. We developed mEnrich-seq (in which ‘m’ stands for methylation and seq for sequencing) for enriching taxa of interest from metagenomic DNA before seq...