Navarro, G. (2004), `Indexing text using the ZivLempel trie', Journal of Discrete Algorithms 2(1), 87--114. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Advantages of Backward Searching - Efficient Secondary.. - Mäkinen, Navarro.. Self-citation (Navarro) (Correct)
No context found.
G. Navarro. Indexing text using the Ziv-Lempel trie. J. of Discrete Algorithms 2(1):87-114, 2004.
Indexing Text using the Ziv-Lempel Trie - Navarro (2002) (2 citations) Self-citation (Navarro) (Correct)
No context found.
G. Navarro. Indexing text using the Ziv-Lempel trie. In Proc. 9th Intl. Symp. String Processing and Information Retrieval (SPIRE'02), LNCS 2476, pages 325-336, 2002.
Compressed Compact Suffix Arrays - Mäkinen, Navarro Self-citation (Navarro) (Correct)
No context found.
G. Navarro. Indexing Text using the Ziv-Lempel Trie. In Proc. 9th String Processing and Information Retrieval (SPIRE'02), LNCS 2476, pp. 325336, 2002. Extended version to appear in J. of Discrete Algorithms.
Suffix Arrays: What Are They Good for? - Puglisi, Smyth, al. (2006) (Correct)
No context found.
Navarro, G. (2004), `Indexing text using the ZivLempel trie', Journal of Discrete Algorithms 2(1), 87--114.
Row-wise tiling for the Myers' bit-parallel approximate string.. - Fredriksson (Correct)
No context found.
G. Navarro. Indexing text using the ziv-lempel trie. In Proceedings of the 9th International Symposium on String Processing and Information Retrieval (SPIRE 2002), LNCS 2476, pages 325-336. Springer, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC