Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Life Sciences
Efficient Algorithms For Prokaryotic Whole Genome Assembly And Finishing, Abhishek Biswas
Efficient Algorithms For Prokaryotic Whole Genome Assembly And Finishing, Abhishek Biswas
Computer Science Theses & Dissertations
De-novo genome assembly from DNA fragments is primarily based on sequence overlap information. In addition, mate-pair reads or paired-end reads provide linking information for joining gaps and bridging repeat regions. Genome assemblers in general assemble long contiguous sequences (contigs) using both overlapping reads and linked reads until the assembly runs into an ambiguous repeat region. These contigs are further bridged into scaffolds using linked read information. However, errors can be made in both phases of assembly due to high error threshold of overlap acceptance and linking based on too few mate reads. Identical as well as similar repeat regions can …