English

Detecting Mutations by eBWT

Data Structures and Algorithms 2018-05-11 v3

Abstract

In this paper we develop a theory describing how the extended Burrows-Wheeler Transform (eBWT) of a collection of DNA fragments tends to cluster together the copies of nucleotides sequenced from a genome G. Our theory accurately predicts how many copies of any nucleotide are expected inside each such cluster, and how an elegant and precise LCP array based procedure can locate these clusters in the eBWT. Our findings are very general and can be applied to a wide range of different problems. In this paper, we consider the case of alignment-free and reference-free SNPs discovery in multiple collections of reads. We note that, in accordance with our theoretical results, SNPs are clustered in the eBWT of the reads collection, and we develop a tool finding SNPs with a simple scan of the eBWT and LCP arrays. Preliminary results show that our method requires much less coverage than state-of-the-art tools while drastically improving precision and sensitivity.

Cite

@article{arxiv.1805.01876,
  title  = {Detecting Mutations by eBWT},
  author = {Nicola Prezza and Nadia Pisanti and Marinella Sciortino and Giovanna Rosone},
  journal= {arXiv preprint arXiv:1805.01876},
  year   = {2018}
}

Comments

simplified Proposition 4; extended Thm 2 to ambiguous clusters

R2 v1 2026-06-23T01:45:30.863Z