Netherlands / United States / China / United Kingdom / /
Currency
USD / / /
Facility
Computer Laboratory / University of Cambridge / M. M. Garner / Chinese University of Hong Kong / /
IndustryTerm
exponential frequent itemset mining / huge and complicated search space / representative algorithms / machinery / generic spaced motifs using submotif pattern mining / spaced motif algorithms / similar solutions / sub-optimal solutions / w-solutions / genetic algorithm / final solutions / motif discovery algorithms / frequent itemset mining / huge search space / genetic algorithms / search space / frequent itemset mining techniques / all n solutions / /
Organization
TP PC / FP TP / Research Grants Council of the Hong Kong SAR / Chinese University of Hong Kong / Department of Computer Science and Engineering / Computational Intelligence / Congress / World Congress / University of Cambridge / /
Person
Kin-Hong Lee / Ming Chan / Algorithm Tak-Ming Chan / Pietro Lio / LexA / Kwong-Sak Leung / / /
Position
representative / /
ProvinceOrState
Georgia / /
PublishedMedium
Genome Research / Molecular Biology / /
Technology
three algorithms / Bioinformatics / spaced motif algorithms / genetic algorithm / DNA binding / two representative algorithms / two algorithms / gene expression / Existing algorithms / motif discovery algorithms / gel electrophoresis / /
WCCI 2010 IEEE World Congress on Computational Intelligence July, 18-23, [removed]CCIB, Barcelona, Spain CEC IEEE Generic Spaced DNA Motif Discovery Using Genetic Algorithm