A Rapid r-Continuous Bits Matching Algorithm for Large-Scale Immunocomputing

R-continuous bits matching is the most fundamental and common-used rule in AIS, which is used to measure the similarity between detectors and strings to be detected. Usually the time complexity is proportional to the size of detectors used (denoted as NR). To improve the runtime detecting efficiency...

Full description

Saved in:
Bibliographic Details
Published in2008 International Conference on Computer Science and Software Engineering Vol. 1; pp. 431 - 434
Main Authors Weiping Zheng, Deyu Qi, Kefu Xu, Haiwen Han
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2008
Subjects
Biological information theory
Computer science
Detectors
Encoding
Immune system
Intrusion detection
Large-scale systems
Object detection
Pattern matching
Runtime
Online AccessGet full text

Cover

More Information
Summary:R-continuous bits matching is the most fundamental and common-used rule in AIS, which is used to measure the similarity between detectors and strings to be detected. Usually the time complexity is proportional to the size of detectors used (denoted as NR). To improve the runtime detecting efficiency, a rapid r-continuous bits matching algorithm is presented in this paper. Our algorithm first produces location vectors before handling real detection. Location vectors record the position information of all possible r-bits patterns extracted from the detector set. When detecting a string, our algorithm just queries location vectors and no need to access the detectors in use. Time complexity of our algorithm in run-time detection period is O(l-r+1) which is a dramatically progress compared to the original time complexity O(N R .(l-r+1)). Furthermore, this time complexity is irrelevant to the size of detector set used. This valuable characteristic makes it especially suitable for large-scale immunocomputing where NR may be very large.
ISBN:0769533361
9780769533360
DOI:10.1109/CSSE.2008.372