Ant Colony Optimization
An approximation algorithm for haplotype inference by maximum parsimony
Proceedings of the 2005 ACM symposium on Applied computing
Haplotype Phasing Using Semidefinite Programming
BIBE '05 Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering
Integer Programming Approaches to Haplotype Inference by Pure Parsimony
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms
INFORMS Journal on Computing
Efficient haplotype inference with boolean satisfiability
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Haplotype inference by pure Parsimony
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
SAT in bioinformatics: making the case with haplotype inference
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
The hyper-cube framework for ant colony optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 0.00 |
Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genotype. This information enables researchers to perform association studies for the genetic variants involved in diseases and the individual responses to therapeutic agents.A notable approach to the problem is to encode it as a combinatorial problem under certain hypotheses (such as the pure parsimonycriterion) and to solve it using off-the-shelf combinatorial optimization techniques. At present, the main methods applied to Haplotype Inference are either simple greedy heuristic or exact methods, which are adequate only for moderate size instances.In this paper, we present an iterative constructive approach to Haplotype Inference based on ACO and we compare it against a state-of-the-art exact method.