Fast Searching in Packed Strings-Reference-Cited by-同舟云学术

Fast Searching in Packed Strings

Published:2009 Issue: Volume: Page:116-126
ISSN:0302-9743
Container-title:Combinatorial Pattern Matching
language:
Short-container-title:

Author:

Bille Philip

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-02441-2_11

Reference21 articles.

1. Amir, A., Benson, G.: Efficient two-dimensional compressed matching. In: Proceedings of the 2nd Data Compression Conference, pp. 279–288 (1992)

2. Amir, A., Benson, G.: Two-dimensional periodicity and its applications. In: Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 440–452 (1992)

3. Amir, A., Benson, G., Farach, M.: Let sleeping files lie: pattern matching in Z-compressed files. J. Comput. System Sci. 52(2), 299–307 (1996)

4. Arlazarov, V.L., Dinic, E.A., Kronrod, M.A., Faradzev, I.A.: On economic construction of the transitive closure of a directed graph (in russian). english translation in soviet math. dokl. 11, 1209–1210 (1975); Dokl. Acad. Nauk. 194, 487–488 (1970)

5. Baeza-Yates, R., Gonnet, G.H.: A new approach to text searching. Commun. ACM 35(10), 74–82 (1992)

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

1. Deep Learning Based Fusion Models for Sensitive Information Identification;2023 IEEE 6th Information Technology,Networking,Electronic and Automation Control Conference (ITNEC);2023-02-24

2. Average Optimal String Matching in Packed Strings;Lecture Notes in Computer Science;2013

3. Worst-case efficient single and multiple string matching on packed texts in the word-RAM model;Journal of Discrete Algorithms;2012-07

4. Worst Case Efficient Single and Multiple String Matching in the RAM Model;Lecture Notes in Computer Science;2011

5. From Nondeterministic Suffix Automaton to Lazy Suffix Tree;Algorithms and Applications;2010