“…The graph algorithms for DNA sequencing have been studied a lot. Comparison studies about the computation time and memory consumption needed for various math models, different genome sizes and overlapping coverage depths, with some error/mismatch or not, and so on, have been published as revealed in 12 and its references. Instead of analyzing the efficiency of known graph algorithms, we tried to test sequences for known and unknown genomes both mathematically and experimentally.…”