An investigation of R-chunk detector generation on higher alphabets

Thomas Stibor, Kpatscha M. Bayarou, Claudia Eckert

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

35 Scopus citations

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 Σ. We show that higher alphabets influence the number of generatable detectors in a negative manner.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsKalyanmoy Deb, Riccardo Poli, Owen Holland, Kalyanmoy Banzhaf, Hans-Georg Beyer, Edmund Burke, Paul Darwen, Dipankar Dasgupta, Dario Floreano, James Foster, Mark Harman, Pier Luca Lanzi, Lee Spector, Andrea G. B. Tettamanzi, Dirk Thierens, Andrew M. Tyrrell
PublisherSpringer Verlag
Pages299-307
Number of pages9
ISBN (Print)3540223444, 9783540223443
DOIs
StatePublished - 2004
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3102
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'An investigation of R-chunk detector generation on higher alphabets'. Together they form a unique fingerprint.

Cite this