The most significant differences between second and third sequencing generation are length of reads and percentage of errors. In the field of de novo DNA assembly there is a need for new effective algorithms as these used for second generation reads are highly ineffective or even unusable when applied to the successor. In this article we propose a solution tailored for DNA assembly of reads from third generation sequencers. In this approach we use overlap-layout-consensus (OLC) graph method. It is composed of number of algorithms focusing on time and memory optimization. The proposed algorithm was implemented as shared library and added as a new module to the ’dnaasm’ de novo assembler. The implementation has been tested on simulated as well as real data. Results prove increase in speed and memory consumption in comparison with other de novo DNA assemblers.