tailieunhanh - Simplitigs as an efficient and scalable representation of de Bruijn graphs

Here, we introduce simplitigs as a compact, efficient, and scalable representation, and ProphAsm, a fast algorithm for their computation. For the example of assemblies of model organisms and two bacterial pan-genomes, we compare simplitigs to unitigs, the best existing representation, and demonstrate that simplitigs provide a substantial improvement in the cumulative sequence length and their number. |

TỪ KHÓA LIÊN QUAN