A low-complexity probabilistic genome assembly based on hashing functions with SNP detection
This paper presents an efficient low-complexity genome assembly algorithm with the ability to detect bit errors (SNPs). A hashing function is used to reduce the complexity of the assembly process. The algorithm is tested against genomic sequences of different lengths. Its performance in terms of completeness, accuracy, and efficiency (time and space) is evaluated against Phrap, a well-known sequence assembly tool. It is shown that the proposed assembly algorithm outperforms Phrap in terms of accuracy, time, and memory.