Informatics for PacBio Long Reads
In this article, we review the development of a wide variety of bioinformatics software implementing state-of-the-art algorithms since the introduction of SMRT sequencing technology into the field. We focus on the three major categories of development: read mapping (aligning to reference genomes), de novo assembly, and detection of structural variants. The long SMRT reads benefit all the applications, but they are achievable only through considering the nature of the long reads technology properly.
I’d like to thank Yoshihiko Suzuki, Yuichi Motai and Dr./Prof. Shinichi Morishita for insightful comments on the draft.
- Abouelhoda MI, Ohlebusch E. A local chaining algorithm and its applications in comparative genomics. International workshop on algorithms in bioinformatics. Berlin/Heidelberg: Springer; 2003.Google Scholar
- Ferragina P, Manzini G. Opportunistic data structures with applications. Foundations of computer science, 2000. Proceedings. 41st annual symposium on. IEEE, 2000.Google Scholar
- Li H. Aligning sequence reads, clone sequences and assembly contigs with BWA-MEM. arXiv preprint arXiv. 2013:1303.3997.Google Scholar
- Li H. Minimap2: versatile pairwise alignment for nucleotide sequences. arXiv. 2017:1708.Google Scholar
- Myers G. Efficient local alignment discovery amongst noisy long reads. International workshop on algorithms in bioinformatics. Berlin/Heidelberg: Springer; 2014.Google Scholar
- Sedlazeck FJ, et al. Accurate detection of complex structural variations using single molecule sequencing. bioRxiv. 2017:169557.Google Scholar
- Suzuki H, Kasahara M. Acceleration of nucleotide semi-global alignment with adaptive banded dynamic programming. bioRxiv. 2017:130633.Google Scholar