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）是一个图形，与重叠图一样，它对n个字符串的给定集合P中的重叠进行编码。一种最著名的算法在O（|| P || log n）时间和O（|| P ||）空间中构造HOG，其中|| P || 是P中字符串长度的总和。在本文中，我们提出了一种在O（|| P ||）时空中构造HOG的新算法。因此，HOG的构建时间和空间比重叠图的O（|| P || + n ^ 2）更好。