By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Weiping Zheng ; Coll. of Comput. Sci. & Eng., South China Univ. of Technol., Guangzhou ; Deyu Qi ; Kefu Xu ; Haiwen Han

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(NR.(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.

Published in:

Computer Science and Software Engineering, 2008 International Conference on  (Volume:1 )

Date of Conference:

12-14 Dec. 2008