The Community for Technology Leaders
Green Image
Issue No. 03 - July-September (2010 vol. 7)
ISSN: 1545-5963
pp: 511-523
Leonardo Tininini , CNR-Istituto di Analisi dei Sistemi e Informatica, Roma
Paola Bertolazzi , CNR-Istituto di Analisi dei Sistemi e Informatica, Roma
Alessandra Godi , CNR-Istituto di Analisi dei Sistemi e Informatica, Roma
Giuseppe Lancia , University of Udine, Udine
Haplotype data play a relevant role in several genetic studies, e.g., mapping of complex disease genes, drug design, and evolutionary studies on populations. However, the experimental determination of haplotypes is expensive and time-consuming. This motivates the increasing interest in techniques for inferring haplotype data from genotypes, which can instead be obtained quickly and economically. Several such techniques are based on the maximum parsimony principle, which has been justified by both experimental results and theoretical arguments. However, the problem of haplotype inference by parsimony was shown to be NP-hard, thus limiting the applicability of exact parsimony-based techniques to relatively small data sets. In this paper, we introduce collapse rule, a generalization of the well-known Clark's rule, and describe a new heuristic algorithm for haplotype inference (implemented in a program called CollHaps), based on parsimony and the iterative application of collapse rules. The performance of CollHaps is tested on several data sets. The experiments show that CollHaps enables the user to process large data sets obtaining very “parsimonious” solutions in short processing times. They also show a correlation, especially for large data sets, between parsimony and correct reconstruction, supporting the validity of the parsimony principle to produce accurate solutions.
Biology and genetics, heuristic methods, discrete mathematics.

G. Lancia, L. Tininini, A. Godi and P. Bertolazzi, "CollHaps: A Heuristic Approach to Haplotype Inference by Parsimony," in IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 7, no. , pp. 511-523, 2008.
101 ms
(Ver 3.3 (11022016))