In collaboration with Prof. K. Park and Dr. S. Park, from the Seoul National University, in Southern Korea, we propose a new, efficient algorithm to build the Hierarchical Overlap Graph (HOG). This graph stores succinctly the ways overlapping reads can be merged to build superstrings.
The article has been accepted for publication at SPIRE 2020 (see https://www.cs.ucf.edu/spire2020/index.php/accepted-papers/).
