Multiple approximate string matching algorithm of network information audit system

Ruan Jian Xue Bao/Journal of Software

Volumn 15, Issue 7, 2004, Pages 1074-1080

  Gao, Peng ^a   Zhang, De Yun ^a   Sun, Qin Dong ^a   Zhai, Ya Hui ^a   Lu, Wu Chun ^a  

^a XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

Finite state machine; Information audit; Matching allowing errors; Multiple approximate string match

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; ERRORS; FINITE AUTOMATA; INFORMATION RETRIEVAL; PATTERN MATCHING;

FINITE STATE MACHINES; INFORMATION AUDITING; MATCHING ALLOWING ERRORS; MULTIPLE APPROXIMATE STRING MATCHING; NETWORK INFORMATION; SINGLE PATTERN MATCHING MACHINES; STATE DRIVERS;

SECURITY OF DATA;

EID: 4544312948     PISSN: 10009825     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (9)

1. Muth R, Manber U. Approximate multiple string match. In: Hirschberg D, Meyers G, eds. Proc. of the CPM'96. LNCS 1075, Springer-Verlag, 1996. 75-86.
2. Ricardo B-Y, Gonzalo N. New and faster filters for multiple approximate string matching. Random Structures and Algorithms, 2002, 20(1): 23-49.
3. Gonzalo N, Ricardo B-Y. Fast multidimensional approximate pattern matching. In: Crochemore M, Paterson M, eds. Proc. of the CPM'99. LNCS 1645, Springer-Verlag, 1999. 243-257.
4. Ricardo B-Y. Regnier M. Fast algorithms for two dimensional and multiple pattern matching. In: JR Gilbert BR, Karlsson R, eds. Proc. of the SWAT'90. LNCS 447, Springer-Verlag, 1990. 332-347.
5. Gonzalo N. Multiple approximate string matching by counting. In: Proc. of the WSP'97. Carleton University Press, 1997. 125-139.
6. Levenshtein VI. Binary codes capable of correcting deletions, insertions and reversals. Sov. Phys. Dokl, 1966. 707-710.
7. Das G, Fleisher R, Gasieniek L, Gunopulos D, Karkainen J. Episode matching. In: Apostolico A, Hein J, eds. Proc. of the CPM'97. LNCS 1264, Springer-Verlag, 1997. 12-27.
8. Xu YZ, Wang YC, Shen Z. A fast algorithm for matching multiple patterns. Journal of Shanghai Jiaotong University, 2002, 36(4): 516-520 (in Chinese with English abstract).
9. Ukkonen E. Approximate string matching with q-grams and maximal matches. Theoretical Computer Science, 1992, 1: 191-211.