Advantages of Backward Searching — Efficient Secondary Memory and Distributed Implementation of Compressed Suffix Arrays-Reference-Cited by-同舟云学术

Advantages of Backward Searching — Efficient Secondary Memory and Distributed Implementation of Compressed Suffix Arrays

Published:2004 Issue: Volume: Page:681-692
ISSN:0302-9743
Container-title:Algorithms and Computation
language:
Short-container-title:

Author:

Mäkinen Veli,Navarro Gonzalo,Sadakane Kunihiko

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-30551-4_59.pdf

Reference26 articles.

1. Arlazarov, V.L., Dinic, E.A., Kronrod, M.A., Faradzev, I.A.: On economic construction of the transitive closure of a directed graph. In: Dokl. Acad. Nauk. SSSR 194, pp. 487–488 (1970) (in Russian); English translation in Soviet Math. Dokl. 11, 1209–1210, (1975).

2. Clark, D.: Compact Pat Trees. PhD thesis, University of Waterloo (1996)

3. Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: Proc. FOCS 2000, pp. 390–398 (2000)

4. Lecture Notes in Computer Science;P. Ferragina,2004

5. Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: Proc. SODA 2003, pp. 841–850 (2003)

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

1. Scalable Text Index Construction;Lecture Notes in Computer Science;2022

2. Tree Contraction for Compressed Suffix Arrays on Modern Processors;Database Systems for Advanced Applications;2015

3. Geometric BWT: Compressed Text Indexing via Sparse Suffixes and Range Searching;Algorithmica;2013-05-10

4. Storage and Retrieval of Highly Repetitive Sequence Collections;Journal of Computational Biology;2010-03

5. Parallel and Distributed Compressed Indexes;Combinatorial Pattern Matching;2010