I have a set of paired end reads from an unknown species. I want to assemble them to find the main genome. I have a program based on the basic de bruijn graph algorithm which is for single reads. Are there any other classic algorithm which works better in the case of paired end reads.? (Or any other version of de bruijn graph algorithm) Also I have 3 versions of these reads from 3 sample of the same species. Could them help me to improve my assembler?