@inproceedings{b020b5ead5f94c24a2585fcf737a3cc2,
title = "A novel negative selection algorithm with an array of partial matching lengths for each detector",
abstract = "A novel negative selection algorithm, namely r[]-NSA, is proposed in this paper, which uses an array to store multiple partial matching lengths for each detector. Every bit of one detector is assigned a partial matching length. As for a detector, the partial matching length of one bit means that one string is asserted to be matched by the detector, if and only if the number of the maximal continuous identical bits between them from the position of the bit to the end of strings is no less than the partial matching length, and the continuous identical bits should start from the position of the bit. The detector generation algorithm and detection algorithm of r[]-NSA are given. Experimental results showed that r[]-NSA has better detector generation efficiency and detection performance than traditional negative selection algorithm.",
author = "Wenjian Luo and Xin Wang and Ying Tan and Xufa Wang",
year = "2006",
doi = "10.1007/11844297\_12",
language = "英语",
isbn = "3540389903",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "112--121",
booktitle = "Parallel Problem Solving from Nature, PPSN IX - 9th International Conference, Procedings",
address = "德国",
note = "9th International Conference on Parallel Problem Solving from Nature, PPSN IX ; Conference date: 09-09-2006 Through 13-09-2006",
}