Paper Info
Title
Clover: tree structure-based efficient DNA clustering for DNA-based data storage
Abstract
Deoxyribonucleic acid (DNA)-based data storage is a promising new storage technology which has the advantage of high storage capacity and long storage time compared with traditional storage media. However, the synthesis and sequencing process of DNA can randomly generate many types of errors, which makes it more difficult to cluster DNA sequences to recover DNA information. Currently, the available DNA clustering algorithms are targeted at DNA sequences in the biological domain, which not only cannot adapt to the characteristics of sequences in DNA storage, but also tend to be unacceptably time-consuming for billions of DNA sequences in DNA storage. In this paper, we propose an efficient DNA clustering method termed Clover for DNA storage with linear computational complexity and low memory. Clover avoids the computation of the Levenshtein distance by using a tree structure for interval-specific retrieval. We argue through theoretical proofs that Clover has standard linear computational complexity, low space complexity, etc. Experiments show that our method can cluster 10 million DNA sequences into 50 000 classes in 10 s and meet an accuracy rate of over 99%. Furthermore, we have successfully completed an unprecedented clustering of 10 billion DNA data on a single home computer and the time consumption still satisfies the linear relationship. Clover is freely available at https://github.com/Guanjinqu/Clover.
Year
DOI
Venue
2022
10.1093/BIB/BBAC336
Briefings in Bioinformatics
Keywords
DocType
Volume
DNA clustering,DNA storage,Levenshtein distance,Tree structure
Journal
23
Issue
ISSN
Citations 
5
1477-4054
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Guanjin Qu100.34
Zihui Yan200.34
Huaming Wu38114.49