The overlap stage of a string graph-based assembler is considered one of the most time- and space-consuming stages in any de novo overlap-based assembler. This is due to the huge output of the next-generation sequencing ...