Alphabet-independent linear-time construction of compressed suffix arrays using <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>o</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mo>log</mml:mo><mml:mi>n</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-bit working space-Reference-Cited by-同舟云学术

Alphabet-independent linear-time construction of compressed suffix arrays using o(nlogn)-bit working space

Published:2007-10 Issue:1-3 Volume:385 Page:127-136
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Na Joong Chae,Park Kunsoo

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference18 articles.

1. M. Burrows, D.J. Wheeler, A block-sorting lossless data compression algorithm, Technical Report 124, Digital Equipment Corporation, Paolo Alto, California, 1994

2. D.R. Clark, Compact pat trees, Ph.D. Thesis, University of Waterloo, Waterloo, 1996

3. M. Farach, Optimal suffix tree construction with large alphabets, in: Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, 1997, pp. 137–143

4. On the sorting-complexity of suffix tree construction;Farach-Colton;Journal of the ACM,2000

5. Indexing compressed text;Ferragina;Journal of the ACM,2005

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

1. Library and Function Identification by Optimized Pattern Matching on Compressed Databases;Proceedings of the 2nd Reversing and Offensive-oriented Trends Symposium on ZZZ - ROOTS '18;2018

2. Burrows-Wheeler Transform;Encyclopedia of Algorithms;2016

3. Computing the Burrows–Wheeler transform in place and in small space;Journal of Discrete Algorithms;2015-05

4. Burrows-Wheeler Transform;Encyclopedia of Algorithms;2015

5. Burrows-Wheeler Transform;Encyclopedia of Algorithms;2014