Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Schemata, Distributions and Graphical Models in Evolutionary Optimization
Journal of Heuristics
Haplotypes and informative SNP selection algorithms: don't block out information
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
Using Optimal Dependency-Trees for Combinational Optimization
ICML '97 Proceedings of the Fourteenth International Conference on Machine Learning
From Recombination of Genes to the Estimation of Distributions I. Binary Parameters
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning
Bayesian haplo-type inference via the dirichlet process
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Bioinformatics
Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms (Studies in Fuzziness and Soft Computing)
Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications (Studies in Computational Intelligence)
Adding Probabilistic Dependencies to the Search of Protein Side Chain Configurations Using EDAs
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Efficient Genome Wide Tagging by Reduction to SAT
WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics
EvoBIO'07 Proceedings of the 5th European conference on Evolutionary computation, machine learning and data mining in bioinformatics
A new method for solving hard satisfiability problems
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
IEEE Transactions on Evolutionary Computation
Parallel Implementation of EDAs Based on Probabilistic Graphical Models
IEEE Transactions on Evolutionary Computation
Approximating discrete probability distributions with dependence trees
IEEE Transactions on Information Theory
Identifying a small set of marker genes using minimum expected cost of misclassification
Artificial Intelligence in Medicine
Efficiently identifying significant associations in genome-wide association studies
RECOMB'13 Proceedings of the 17th international conference on Research in Computational Molecular Biology
| Hi-index | 0.00 |
Objectives: This paper presents an optimization algorithm for the automatic selection of a minimal subset of tagging single nucleotide polymorphisms (SNPs). Methods and materials: The determination of the set of minimal tagging SNPs is approached as an optimization problem in which each tagged SNP can be covered by a single tagging SNP or by a pair of tagging SNPs. The problem is solved using an estimation of distribution algorithm (EDA) which takes advantage of the underlying topological structure defined by the SNP correlations to model the problem interactions. The EDA stochastically searches the constrained space of feasible solutions. It is evaluated across HapMap reference panel data sets. Results: The EDA was compared with a SAT solver, able to find the single-marker minimal tagging sets, and with the Tagger program. The percentage of reduction ranged from 10% to 43% in the number of tagging SNPs of the minimal multi-marker tagging set found by the EDA with respect to the other algorithms. Conclusions: The introduced algorithm is effective for the identification of minimal multi-marker SNP sets, which considerably reduce the dimension of the tagging SNP set in comparison with single-marker sets. Other variants of the SNP problem can be treated following the same approach.