The hierarchical overlap graph (HOG) is a graph that encodes overlaps from a given set P of n strings, as the overlap graph does. A best known algorithm constructs HOG in O(||P|| log n) time and O(||P||) space, where ||P|| is the sum of lengths of the strings in P. In this paper we present a new algorithm to construct HOG in O(||P||) time and space. Hence, the construction time and space of HOG are better than those of the overlap graph, which are O(||P|| + n^2).

翻译：等级重叠图( HOG) 是一个图表, 编码与给定的 P 组 n 字符串相重叠, 正如重叠图一样。 最著名的算法在 O( ⁇ ⁇ ⁇ log n) 时间和 O( ⁇ ⁇ ⁇ ) 空间中构造 HRG, 其中 ⁇ P 是 P 字符串长度的总和 。 在本文件中, 我们提出一个新的算法, 在 O( ⁇ ⁇ ⁇ ) 时间和空间中构造 HRG 。 因此, HRG 的构造时间和空间比重叠图的要好, 即 O( ⁇ ⁇ + n) 。