The crossover closure and partial match detection

Fernando Esponda; Stephanie Forrest; Paul Helman

The crossover closure and partial match detection

Fernando Esponda, Stephanie Forrest, Paul Helman

Research output: Contribution to journal › Article › peer-review

Abstract

The crossover closure generation rule characterizes the generalization achieved by artificial immune systems using partial match detection. The paper reviews earlier results and extends the previously introduced notion of crossover closure to encompass additional match rules. For concreteness, the discussion focuses on r-chunks matching, giving alternative ways that detectors can be used to implement the crossover closure.

Original language	English (US)
Pages (from-to)	249-260
Number of pages	12
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2787
State	Published - Dec 1 2003
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Cite this

@article{ba774180e7ae4d288e1bca7cc0913e4b,

title = "The crossover closure and partial match detection",

abstract = "The crossover closure generation rule characterizes the generalization achieved by artificial immune systems using partial match detection. The paper reviews earlier results and extends the previously introduced notion of crossover closure to encompass additional match rules. For concreteness, the discussion focuses on r-chunks matching, giving alternative ways that detectors can be used to implement the crossover closure.",

author = "Fernando Esponda and Stephanie Forrest and Paul Helman",

year = "2003",

month = dec,

day = "1",

language = "English (US)",

volume = "2787",

pages = "249--260",

journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

issn = "0302-9743",

publisher = "Springer Verlag",

}

TY - JOUR

T1 - The crossover closure and partial match detection

AU - Esponda, Fernando

AU - Forrest, Stephanie

AU - Helman, Paul

PY - 2003/12/1

Y1 - 2003/12/1

N2 - The crossover closure generation rule characterizes the generalization achieved by artificial immune systems using partial match detection. The paper reviews earlier results and extends the previously introduced notion of crossover closure to encompass additional match rules. For concreteness, the discussion focuses on r-chunks matching, giving alternative ways that detectors can be used to implement the crossover closure.

AB - The crossover closure generation rule characterizes the generalization achieved by artificial immune systems using partial match detection. The paper reviews earlier results and extends the previously introduced notion of crossover closure to encompass additional match rules. For concreteness, the discussion focuses on r-chunks matching, giving alternative ways that detectors can be used to implement the crossover closure.

UR - http://www.scopus.com/inward/record.url?scp=33751021639&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33751021639&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:33751021639

SN - 0302-9743

VL - 2787

SP - 249

EP - 260

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -

The crossover closure and partial match detection

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this