发现好书期刊，享受阅读乐趣

海量图书期刊资源，随时随地畅享阅读乐趣

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

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

Beller, Timo; Gog, Simon; Ohlebusch, Enno; Schnattinger, Thomas

期刊名称Journal of Discrete Algorithms
作者Beller, Timo; Gog, Simon; Ohlebusch, Enno; Schnattinger, Thomas
卷第18卷
印刷ISSN1570-8667
文件大小301.75KB
发表时间2013-1
DOI10.1016/j.jda.2012.07.007
页码22-31

← 返回【学霸图书馆】主页