Identification of co-occurring insertions in cancer genomes using association analysis Online publication date: Tue, 21-Oct-2014
by Michael Steinbach; Sean Landman; Vipin Kumar; Haoyu Yu
International Journal of Data Mining and Bioinformatics (IJDMB), Vol. 10, No. 1, 2014
Abstract: Collections of tumour genomes created by insertional mutagenesis experiments, e.g., the Retroviral Tagged Cancer Gene Database (RTCGD), can be analysed to find connections between mutations of specific genes and cancer. Such connections are found by identifying the locations of insertions or groups of insertions that frequently occur in the collection of tumour genomes. Recent work has employed a kernel density approach to find such commonly occurring insertions or co-occurring pairs of insertions. Unfortunately, this approach is extremely compute intensive for pairs of insertions and even more intractable for triples, etc. We present a technique that can efficiently find commonly co-occurring sets of insertions (or other genomic features) of any length by applying Association Analysis (AA) (frequent pattern mining) techniques from data mining. A comparison to the kernel density approach on RTCGD is provided, as well as results of the association approach on two other tumour data sets.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Data Mining and Bioinformatics (IJDMB):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook