Efficient String Matching: An Aid to Bibliographic Search
many patterns at once, with failure links over a trie
Read it
EnglishTiếng Việt (abstract only)中文 (abstract only)日本語 (abstract only)
English beside Tiếng ViệtEnglish beside 中文English beside 日本語
- 11 sections
- 0 figures
- 0 equations
- 17 references
- cited by 0 here
- difficulty 3 of 5
- the publisher's page
Contents
- 1Introduction
- 2A Pattern Matching Machine
- 3Construction of Goto, Failure, and Output Functions
- 4Properties of Algorithms 1, 2, and 3
- 5Time Complexity of Algorithms 1, 2, and 3
- 6Eliminating Failure Transitions
- 7An Application to Bibliographic Search
- 8Concluding Remarks
- Acknowledgments