A linear time algorithm for Shortest Cyclic Cover of Strings-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A linear time algorithm for Shortest Cyclic Cover of Strings

Published:2016-03 Issue: Volume:37 Page:56-67
ISSN:1570-8667
Container-title:Journal of Discrete Algorithms
language:en
Short-container-title:Journal of Discrete Algorithms

Author:

Cazaux Bastien,Rivals Eric^ORCID

Funder

ANR

CNRS

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference20 articles.

1. Linear approximation of shortest superstrings;Blum,1991

2. On suffix extensions in suffix trees;Breslauer;Theor. Comput. Sci.,2012

3. Rotations of periodic strings and short superstrings;Breslauer;J. Algorithms,1997

4. Approximation of greedy algorithms for Max-ATSP, Maximal Compression, Maximal Cycle Cover, and Shortest Cyclic Cover of Strings;Cazaux,2014

5. Reverse engineering of compact suffix trees and links: a novel algorithm;Cazaux;J. Discret. Algorithms,2014

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Masked superstrings as a unified framework for textualk-mer set representations;2023-02-03

2. Hierarchical Overlap Graph;Information Processing Letters;2020-03

3. Efficient Construction of Hierarchical Overlap Graphs;String Processing and Information Retrieval;2020

4. Can We Recover the Cover?;Algorithmica;2019-03-22

5. Superstring Graph: A New Approach for Genome Assembly;Algorithmic Aspects in Information and Management;2016

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP