An Investigation of R-Chunk Detector Generation on Higher Alphabets
We propose an algorithm for generating all possible generatable r-chunk detectors, which do not cover any elements in self set S. In addition, the algorithm data structure is used to estimate the average number of generatable detectors, dependent on set size S, r-chunk length r and alphabet size $\Sigma$. We show that higher alphabets influence the number of generatable detectors in a negative manner.
An Investigation of R-Chunk Detector Generation on Higher Alphabets
Genetic and Evolutionary Computation GECCO 2004
| Authors: | Thomas Stibor, K.M. Bayarou, and Claudia Eckert |
| Year/month: | 2004/ |
| Booktitle: | Genetic and Evolutionary Computation GECCO 2004 |
| Series: | Lecture Notes in Computer Science |
| Pages: | 299-307 |
| Publisher: | Springer-Verlag |
| Fulltext: |
Abstract |
|
| We propose an algorithm for generating all possible generatable r-chunk detectors, which do not cover any elements in self set S. In addition, the algorithm data structure is used to estimate the average number of generatable detectors, dependent on set size S, r-chunk length r and alphabet size $\Sigma$. We show that higher alphabets influence the number of generatable detectors in a negative manner. | |
Bibtex:
@inproceedings { Stibor2004,author = { Thomas Stibor and K.M. Bayarou and Claudia Eckert},
title = { An Investigation of R-Chunk Detector Generation on Higher Alphabets },
year = { 2004 },
booktitle = { Genetic and Evolutionary Computation GECCO 2004 },
series = { Lecture Notes in Computer Science },
pages = { 299-307 },
publisher = { Springer-Verlag },
}