Smooth $q$-Gram, and Its Applications to Detection of Overlaps among Long, Error-Prone Sequencing Reads
Data Structures and Algorithms
2018-02-06 v1
Abstract
We propose smooth -gram, the first variant of -gram that captures -gram pair within a small edit distance. We apply smooth -gram to the problem of detecting overlapping pairs of error-prone reads produced by single molecule real time sequencing (SMRT), which is the first and most critical step of the de novo fragment assembly of SMRT reads. We have implemented and tested our algorithm on a set of real world benchmarks. Our empirical results demonstrated the significant superiority of our algorithm over the existing -gram based algorithms in accuracy.
Cite
@article{arxiv.1802.01189,
title = {Smooth $q$-Gram, and Its Applications to Detection of Overlaps among Long, Error-Prone Sequencing Reads},
author = {Haoyu Zhang and Qin Zhang and Haixu Tang},
journal= {arXiv preprint arXiv:1802.01189},
year = {2018}
}