Fast and memory-efficient noisy read overlapping with KD-trees
Dmitri Parkhomchuk, Andreas Bremges, Alice Carolyn McHardy
The paper introduces a memory-efficient algorithm for detecting read overlaps using KD-trees and tetramers, achieving lower memory usage than existing methods on bacterial sequencing data.
bioRxiv · Jul 21, 2017 · PreprintBioinformatics