A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs

Sangsoo Park, Sung Gwan Park, Bastien Cazaux, Kunsoo Park, Eric Rivals
{"title":"A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs","authors":"Sangsoo Park, Sung Gwan Park, Bastien Cazaux, Kunsoo Park, Eric Rivals","doi":"10.4230/LIPIcs.CPM.2021.22","DOIUrl":null,"url":null,"abstract":"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²).","PeriodicalId":236737,"journal":{"name":"Annual Symposium on Combinatorial Pattern Matching","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annual Symposium on Combinatorial Pattern Matching","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4230/LIPIcs.CPM.2021.22","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

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²).
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种构造分层重叠图的线性时间算法
分层重叠图(HOG)是一种对给定集合P (n个字符串)的重叠进行编码的图,就像重叠图一样。一个最著名的算法在O(||P|| log n)时间和O(||P|)空间上构造HOG,其中|P||是P中字符串长度的和。本文给出了一个在O(| P||)时间和空间上构造HOG的新算法。因此,HOG的构造时间和空间都优于重叠图的构造时间和空间为O(||P|| + n²)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
相关文献
Resultados tras la implementación de un programa de mejora de la calidad del contenido de los informes de alta hospitalaria en insuficiencia cardiaca
IF 0 Revista de Calidad AsistencialPub Date : 2015-03-01 DOI: 10.1016/j.cali.2014.12.008
M.P. Martín-Fortea , B. Amores-Arriaga , M. Sánchez-Marteles , F. Ruiz-Laiglesia , E. Clemente-Roldán , J.I. Pérez-Calvo
Análisis del manejo en tumores presacros en adultos: Experiencia de los últimos 15 años en el Hospital Clínico de la Universidad de Chile
IF 0 Revista de CirugíaPub Date : 2024-01-15 DOI: 10.35687/s2452-454920240011858
Victor Julio Alejandro Cortes Fuentes, Rodrigo Azolas Marcos, Mario Antonio Abedrapo Moreira, Mauricio Javier Diaz Beneventi, Antonella Sanguineti Montalva, Jose Luis Llanos Bravo
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Optimal LZ-End Parsing is Hard From Bit-Parallelism to Quantum String Matching for Labelled Graphs Order-Preserving Squares in Strings Sliding Window String Indexing in Streams Parameterized Algorithms for String Matching to DAGs: Funnels and Beyond
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1