Simultaneously searching for a plurality of patterns...

Details Simultaneously searching for a plurality of patterns... Simultaneously searching for a plurality of patterns...

2007-08-21

2007-08-21

Starks, Jr., Wilbert L. (Department: 2129)

Data processing: artificial intelligence

Machine learning

C706S045000, C709S230000, C712S018000, C717S114000

Reexamination Certificate

active

11257485

ABSTRACT:
An apparatus, a carrier medium carrying computer readable code to implement a method, and a method for searching for a plurality of patterns definable by complex expressions, and further, for efficiently generating data for such searching. One method includes accepting or determining a plurality of state machines for searching for a plurality of patterns, merging the state machines to form a merged state machine, and storing a data structure describing the merged state machine, including state data on the states of the merged state machine. The method is such that pattern matching logic reading state data and accepting a sequence of inputs can search the input sequence for the plurality of patterns.

REFERENCES:
patent: 5014327 (1991-05-01), Potter et al.
patent: 6212184 (2001-04-01), Venkatachary et al.
patent: 6421372 (2002-07-01), Bierly et al.
patent: 6446243 (2002-09-01), Huang et al.
patent: 6691301 (2004-02-01), Bowen
patent: 6944670 (2005-09-01), Krichevski et al.
patent: 7100020 (2006-08-01), Brightman et al.
patent: WO 2004/081761 (2004-09-01), None
M. Crochemore and T. Lecroq. “Pattern Matching and Text Compression Algorithms.” ACM Computing Surveys, vol. 28, No. 1, pp. 39-41, 1996.
Satoru Takabayashi. “Writing Assistance through Search Techniques.” Master's Thesis, Department of Information Processing, Graduate School of Information Science, Nara Institute of Science and Technology, Feb. 9, 2001.
G. Navarro and M. Raffinot. “Fast and Flexible String Matching by Combining Bit-parallelism and Suffix Automata.” ACM Journal of Experimental Algoritmics (JEA), vol. 5, No. 4, 2000.
C.J. Coit, S. Staniford and J. McAlerney. “Towards Faster String Matching for Intrusion Detection or Exceedings the Speed of Snort.” Proceedings of the 2nd DARPA Information Survivability Conference and Exposition (DISCEX II). 2001.
A. Aho and M. Corasick. “Efficient String Matching: An Aid to Bibliographic Search.” Communications of the ACM, vol. 18, No. 6, pp. 333-343, Jun. 1975.
R.S. Boyer and J.S. Moore. “A Fast String Searching Algorithm.” Communication of the ACM, vol. 20, No. 10, pp. 762-772, Oct. 1977.
C. Charras and T. Lecroq. “Handbook of Exact String Matching Algorithms.” King's College London Publications, 2004.
Dan Gusfield, “Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology,” Cambridge University Press; Chapters 5 and 7, 1997.

Affiliated with

Also associated with

Rating

Simultaneously searching for a plurality of patterns... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Simultaneously searching for a plurality of patterns..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simultaneously searching for a plurality of patterns... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3893515