Efficient Algorithm for Circular Burrows-Wheeler Transform-Reference-Cited by-同舟云学术

Efficient Algorithm for Circular Burrows-Wheeler Transform

Published:2012 Issue: Volume: Page:257-268
ISSN:0302-9743
Container-title:Combinatorial Pattern Matching
language:
Short-container-title:

Author:

Hon Wing-Kai,Ku Tsung-Han,Lu Chen-Hua,Shah Rahul,Thankachan Sharma V.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-31265-6_21.pdf

Reference17 articles.

1. Aho, A., Corasick, M.: Efficient String Matching: An Aid to Bibligoraphic Search. Communications of the ACM 18(6), 333–340 (1975)

2. Lecture Notes in Computer Science;D. Belazzougui,2010

3. Burrows, M., Wheeler, D.J.: A Block-sorting Lossless Data Compression Algorithm. Technical Report 124, Digital Equipment Corporation, Paolo Alto, CA, USA (1994)

4. Chan, H.L., Hon, W.K., Lam, T.W., Sadakane, K.: Compressed Indexes for Dynamic Text Collections. ACM Transactions on Algorithms 3(2) (2007)

5. Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press, New York (1994)

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

1. r-indexing the eBWT;Information and Computation;2024-06

2. Generic Non-recursive Suffix Array Construction;ACM Transactions on Algorithms;2024-04-13

3. Extending the Parameterized Burrows–Wheeler Transform;2024 Data Compression Conference (DCC);2024-03-19

4. Constructing and indexing the bijective and extended Burrows–Wheeler transform;Information and Computation;2024-03

5. A new class of string transformations for compressed text indexing;Information and Computation;2023-10