Article: Risk haplotype pattern discovery for gene mapping by recursive partitioning method based on weighted classification trees Journal: International Journal of Computational Intelligence in Bioinformatics and Systems Biology (IJCIBSB) 2010 Vol.1 No.3 pp.213 - 245 Abstract: In this paper, we present a combinatorial approach based on recursive weighted longest prefix trees (RWLPT) for mining a massive genetic marker data. Given a case and a control chromosome dataset, we develop a fast recursive permutation algorithm for building an RWLPT. This algorithm provides an optimal solution to find a privileged order of classifiers for constructing optimum haplotype clusters and biclusters. Using RWLPT model, extracting haplotype clusters and haplotype patterns will be performed in linear time on the number of markers. Employing the measure of linkage disequilibrium and the statistical test, we examine the case-control association analysis for identifying risk haplotype patterns associated with the disease permitting likely location of disease susceptibility genes. We demonstrate that the case-control association test based on haplotype patterns reduces degrees of freedom and number of tests while increasing the power of disease-haplotype association analysis. The experimental results through the real published SNP dataset show that our approach tends to be more effective and powerful than the sliding window approach, classification and regression trees and single marker analysis. Inderscience Publishers - linking academia, business and industry through research

Title: Risk haplotype pattern discovery for gene mapping by recursive partitioning method based on weighted classification trees

Authors: Tran Trang, Hoang Ngoc Minh

Addresses: Centre Integre de Bioinformatique, Universite de Lille 2-1 Place Verdun, F-59045 Lille Cedex, France. ' Centre Integre de Bioinformatique, Universite de Lille 2-1 Place Verdun, F-59045 Lille Cedex, France

Abstract: In this paper, we present a combinatorial approach based on recursive weighted longest prefix trees (RWLPT) for mining a massive genetic marker data. Given a case and a control chromosome dataset, we develop a fast recursive permutation algorithm for building an RWLPT. This algorithm provides an optimal solution to find a privileged order of classifiers for constructing optimum haplotype clusters and biclusters. Using RWLPT model, extracting haplotype clusters and haplotype patterns will be performed in linear time on the number of markers. Employing the measure of linkage disequilibrium and the statistical test, we examine the case-control association analysis for identifying risk haplotype patterns associated with the disease permitting likely location of disease susceptibility genes. We demonstrate that the case-control association test based on haplotype patterns reduces degrees of freedom and number of tests while increasing the power of disease-haplotype association analysis. The experimental results through the real published SNP dataset show that our approach tends to be more effective and powerful than the sliding window approach, classification and regression trees and single marker analysis.

Keywords: combinatorial optimisation; non-numerical algorithms; multilocus SNP analysis; haplotype-disease association; haplotype clusters; risk haplotype pattern discovery; gene mapping; recursive partitioning; weighted classification trees; genetic markers; disease susceptibility genes.

DOI: 10.1504/IJCIBSB.2010.031389

International Journal of Computational Intelligence in Bioinformatics and Systems Biology, 2010 Vol.1 No.3, pp.213 - 245

Published online: 02 Feb 2010 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article

Title: Risk haplotype pattern discovery for gene mapping by recursive partitioning method based on weighted classification trees

Keep up-to-date