TreeDT: Tree Pattern Mining for Gene Mapping

Authors:
Petteri Sevon;Hannu Toivonen;Vesa Ollikainen
Affiliations:
-;-;-
Venue:
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Year:
2006

Citing 3
Cited 2

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
TreeDT: gene mapping by tree disequilibrium test

Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Gene Mapping by Haplotype Pattern Mining

BIBE '00 Proceedings of the 1st IEEE International Symposium on Bioinformatics and Biomedical Engineering

A multiple kernel support vector machine scheme for feature selection and rule extraction from gene expression data of cancer tissue

Artificial Intelligence in Medicine
Risk haplotype pattern discovery for gene mapping by recursive partitioning method based on weighted classification trees

International Journal of Computational Intelligence in Bioinformatics and Systems Biology

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe TreeDT, a novel association-based gene mapping method. Given a set of disease-associated haplotypes and a set of control haplotypes, TreeDT predicts likely locations of a disease susceptibility gene. TreeDT extracts, essentially in the form of haplotype trees, information about historical recombinations in the population: A haplotype tree constructed at a given chromosomal location is an estimate of the genealogy of the haplotypes. TreeDT constructs these trees for all locations on the given haplotypes and performs a novel disequilibrium test on each tree: Is there a small set of subtrees with relatively high proportions of disease-associated chromosomes, suggesting shared genetic history for those and a likely disease gene location? We give a detailed description of TreeDT and the tree disequilibrium tests, we analyze the algorithm formally, and we evaluate its performance experimentally on both simulated and real data sets. Experimental results demonstrate that TreeDT has high accuracy on difficult mapping tasks and comparisons to other methods (EATDT, HPM, TDT) show that TreeDT is very competitive.