Modern techniques of molecular biology may be used to classify an individual of unknown membership to one among the known groups of a reference population. DNA fingerprints, also called molecular profìles, provide an almost infinite amount of raw data for feature extraction, i.e. the Identification of molecular markers. Nevertheless, the huge search space and the small sample size of pilot experiments challenge common search algorithms. We numerically investigate the performances of a Genetic Algorithm (GA) that optimizes a fitness function based on predictive Bayesian distributions. Datasets of molecular profiles are simulated according to vectors of odds that fully characterize marginal distributions. Preliminary results from the analysis of simulations output give hints about the features of the reference population that increase the computational burden required for the Identification task.

Feature extraction from simulated datasets of molecular profiles using a Genetic Algoritm / STEFANINI F.M.; CAMUSSI, A.. - ELETTRONICO. - -:(1999), pp. 0-0. (Intervento presentato al convegno Third International ICSC Symposia on Intelligent Industrial Automation (IIA'99) Soft Computing (SOCO'99) tenutosi a Genova, Italy nel June 1 - 4, 1999).

Feature extraction from simulated datasets of molecular profiles using a Genetic Algoritm

STEFANINI, FEDERICO MATTIA;CAMUSSI, ALESSANDRO
1999

Abstract

Modern techniques of molecular biology may be used to classify an individual of unknown membership to one among the known groups of a reference population. DNA fingerprints, also called molecular profìles, provide an almost infinite amount of raw data for feature extraction, i.e. the Identification of molecular markers. Nevertheless, the huge search space and the small sample size of pilot experiments challenge common search algorithms. We numerically investigate the performances of a Genetic Algorithm (GA) that optimizes a fitness function based on predictive Bayesian distributions. Datasets of molecular profiles are simulated according to vectors of odds that fully characterize marginal distributions. Preliminary results from the analysis of simulations output give hints about the features of the reference population that increase the computational burden required for the Identification task.
1999
Proceedings of the Third International ICSC Symposia on Intelligent Industrial Automation Soft Computing
Third International ICSC Symposia on Intelligent Industrial Automation (IIA'99) Soft Computing (SOCO'99)
Genova, Italy
STEFANINI F.M.; CAMUSSI, A.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificatore per citare o creare un link a questa risorsa: https://hdl.handle.net/2158/237233
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact