Computing the longest common prefix array based on the Burrows–Wheeler transform-Reference-Cited by-同舟云学术

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

Computing the longest common prefix array based on the Burrows–Wheeler transform

Published:2013-01 Issue: Volume:18 Page:22-31
ISSN:1570-8667
Container-title:Journal of Discrete Algorithms
language:en
Short-container-title:Journal of Discrete Algorithms

Author:

Beller Timo,Gog Simon,Ohlebusch Enno,Schnattinger Thomas

Publisher

Elsevier BV

Subject

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

Reference45 articles.

1. Computing the longest common prefix array based on the Burrows–Wheeler transform;Beller,2011

2. Directly addressable variable-length codes;Brisaboa,2009

3. M. Burrows, D.J. Wheeler, A block-sorting lossless data compression algorithm, Research Report 124, Digital Systems Research Center, 1994.

4. Lightweight BWT construction for very large string collections;Cox,2011

5. Automata and forbidden words;Crochemore;Information Processing Letters,1998

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

1. Longest Common Prefix Arrays for Succinct k-Spectra;String Processing and Information Retrieval;2023

2. Constant Time Median Filter Using 2D Wavelet Matrix;ACM Transactions on Graphics;2022-11-30

3. Edge minimization in de Bruijn graphs;Information and Computation;2021-08

4. Space-efficient construction of compressed suffix trees;Theoretical Computer Science;2021-01

5. Linear-time String Indexing and Analysis in Small Space;ACM Transactions on Algorithms;2020-04-27

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP