Currently, there are two widely used classes of algorithms: overlap–layout–consensus (OLC) and de-bruijn-graph (DBG) [1–3]. OLC generally works in three steps: first overlaps (O) among all the reads are found, then it carries out a layout (L) of all the reads and overlaps ...
Many long-read assemblers take the overlap-layout-consensus (OLC) paradigm, which is less sensitive to sequencing errors, heterozygosity and variability of coverage. However, current assemblers of SGS data do not sufficiently take advantage of the OLC approach.Bioinformatics...