GradHC: A New Clustering Algorithm for DNA Storage Systems
Author Information
Author(s): Ben Shabat Dvir, Hadad Adar, Boruchovsky Avital, Yaakobi Eitan
Primary Institution: Technion, Haifa, Israel
Hypothesis
Can a novel clustering algorithm improve the accuracy and efficiency of DNA storage systems?
Conclusion
The GradHC algorithm demonstrates significantly improved stability and accuracy in clustering DNA strands compared to existing methods.
Supporting Evidence
- The GradHC algorithm outperformed existing clustering methods in accuracy and runtime across various datasets.
- Benchmark analysis showed that GradHC is more stable and robust than previously proposed algorithms.
- The algorithm effectively handles varying cluster sizes and error rates in DNA storage systems.
Takeaway
This study introduces a new way to group DNA strands that helps store information better, making it easier to retrieve data later.
Methodology
The GradHC algorithm uses a three-step process to cluster noisy DNA copies, improving performance by dividing data into chunks and applying local-sensitive hashing.
Limitations
The algorithm's performance may vary with different datasets, particularly those with small clusters or high error rates.
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website