Optimal Exact String Matching Based on Suffix Arrays-Reference-Cited by-同舟云学术

Optimal Exact String Matching Based on Suffix Arrays

Published:2002 Issue: Volume: Page:31-43
ISSN:0302-9743
Container-title:String Processing and Information Retrieval
language:
Short-container-title:

Author:

Abouelhoda Mohamed Ibrahim,Ohlebusch Enno,Kurtz Stefan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45735-6_4

Reference13 articles.

1. Lect Notes Comput Sci;M. I. Abouelhoda,2002

2. A. Apostolico. The Myriad Virtues of Subword Trees. In Combinatorial Algorithms on Words, Springer Verlag, pages 85–96, 1985.

3. J. Bentley and R. Sedgewick. Fast Algorithms for Sorting and Searching Strings. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 360–369, 1997.

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

5. P. Ferragina and G. Manzini. An experimental study of an opportunistic index. In Symposium on Discrete Algorithms, pages 269–278, 2001.

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

1. A new efficient indexing algorithm for one-dimensional real scaled patterns;Journal of Computer and System Sciences;2012-01

2. Clustering Documents with Maximal Substrings;Enterprise Information Systems;2012

3. Structator: fast index-based search for RNA sequence-structure patterns;BMC Bioinformatics;2011-05-27

4. Using Bloom Filters for Large Scale Gene Sequence Analysis in Haskell;Practical Aspects of Declarative Languages;2008

5. Indexing Circular Patterns;WALCOM: Algorithms and Computation;2008