Dynamic Dictionary Matching in External Memory

Information and Computation

Volumn 146, Issue 2, 1998, Pages 85-99

  Ferragina, Paolo ^a   Luccio, Fabrizio ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0344941459     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1998.2733     Document Type: Article

References (24)

1. Aho, A. V., and Corasick, M. J. (1975), Efficient string matching: an aid to bibliographic search, Comm. ACM 18, 333-340.
2. Amir, A., and Farach, M. (1991), Adaptive dictionary matching, in "Proc. IEEE Foundations of Computer Science," pp. 760-766.
3. Amir, A., Farach, M., Galil, R., Giancarlo, R., and Park, K. (1994), Dynamic dictionary matching, J. Comput. and System Sci. 49, 208-222.
4. Amir, A., Farach, M., Idury, R. M., La Poutré, H., and Schäffer, A. A. (1995), Improved dictionary matching, Inform. and Comput. 119, 258-282.
5. Amir, A., Farach, M., and Muthukrishnan, S. (1994), Alphabet dependence in parameterized matching, Inform. Processing Lett. 49, 111-115.
6. Baker, S. (1996), A theory of parameterized pattern matching: Algorithms and applications, J. Comput. and System Sci. 52, 28-42.
7. Baker, B. S. (1995), Parameterized pattern matching by Boyer-Moore-type algorithms, in "Proc. of ACM-SIAM Symposium on Discrete Algorithms," pp. 541-550.
8. Breslauer, D. (1995), Dictionary matching on unbounded alphabets: Uniform length dictionaries, J. Algorithms 18, 278-295.
9. Comer, D. (1979), The ubiquitous B-Tree, Computing Surveys 11, 121-137.
10. Ferragina, P., and Grossi, R. (1995), A fully-dynamic data structure for external substring search, in "Proc. ACM Symposium on Theory of Computing," pp. 693-702.
11. Ferragina, P., and Grossi, R. (1995), An external-memory indexing data structure with applications, submitted for publication. [http://www.di.unipi.it/∼ferragin]
12. Ferragina, P., and Grossi, R. (1996), Fast string searching in secondary storage: Theoretical developments and experimental results, in "Proc. of ACM-SIAM Symposium on Discrete Algorithms," pp. 373-382.
13. Ferragina, P., and Luccio, F. (1996), On the parallel dictionary matching problem: new results with applications, in "Proc. European Symposium on Algorithms," Lecture Notes in Computer Science, Vol. 1136, pp. 261-275.
14. Frenkel, K. A. (1991), The human genome project and informatics, Comm. ACM 34, 41-51.
15. Idury, R. M., and Schäffer, A. A. (1994), Dynamic dictionary matching with failure functions, Theoret. Comput. Sci. 131, 295-310.
16. Idury, R. M., and Schäffer, A. A. (1996), Multiple matching of parameterized patterns, Theoret. Comput. Sci. 154, 203-224.
17. Kephart, J. Sorkin, G., Arnold, W., Chess, D., Tesauro, G., and White, S. (1995), Biologically inspired defenses against computer viruses, in "Proc. International Joint Conference on Artificial Intelligence," pp. 1-12.
18. Knuth, D. E. (1973), "The Art of Computer Programming," Chap. 3, Sorting and Searching, Addison-Wesley, Reading, MA.
19. Knuth, D. E., Morris, J. H., and Pratt, V. R. (1977), Fast pattern matching in strings, SIAM J. Comput. 6(2), 63-78.
20. Kosaraju, S. R. (1995), Faster algorithms for the construction of parameterized suffix trees, in "Proc. of IEEE Foundations of Computer Science," pp. 631-639.
21. Manber, U., and Myers, G. (1993), Suffix arrays: a new method for on-line string searches, SIAM J. Comput. 22(5), 935-948.
22. McCreight, E. M. (1976), A space-economical suffix tree construction algorithm, J. ACM 23(2), 262-272.
23. Sahinalp, S. C., and Vishkin, U. (1996), Efficient approximate and dynamic matching of patterns using a labeling paradigm, in "Proc. of IEEE Symposium on Foundations of Computer Science," pp. 320-328.
24. Vitter, J. S., and Shriver, E. A. (1994), Algorithms for parallel memory: Two-level memories, Algorithmica 12, 110-147.