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:2011 Issue: Volume: Page:197-208
ISSN:0302-9743
Container-title:String Processing and Information Retrieval
language:
Short-container-title:

Author:

Beller Timo,Gog Simon,Ohlebusch Enno,Schnattinger Thomas

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-24583-1_20

Reference23 articles.

1. Lecture Notes in Computer Science;N.R. Brisaboa,2009

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

3. Lecture Notes in Computer Science;J.S. Culpepper,2010

4. Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: IEEE Symposium on Foundations of Computer Science, pp. 390–398 (2000)

5. Flick, P., Birney, E.: Sense from sequence reads: Methods for alignment and assembly. Nature Methods 6(11 suppl.), S6–S12 (2009)

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

1. Alphabet-independent algorithms for finding context-sensitive repeats in linear time;Journal of Discrete Algorithms;2015-09

2. The wavelet matrix: An efficient wavelet tree for large alphabets;Information Systems;2015-01

3. Alphabet-Independent Compressed Text Indexing;ACM Transactions on Algorithms;2014-08

4. Linear time construction of compressed text indices in compact space;Proceedings of the forty-sixth annual ACM symposium on Theory of computing;2014-05-31

5. Computing the Burrows–Wheeler transform of a string and its reverse in parallel;Journal of Discrete Algorithms;2014-03