Home  |   Login  |   Logout  |   Access Information  |   Alerts  |   Purchase History  |   Cart  |   Sitemap  |   Help   
 
CrossRef Search
BROWSE SEARCH IEEE XPLORE GUIDE SUPPORT
You requested this document:
1. A Geometrical Model for the SNP Motif Identification Problem
Gaofeng Huang; Jeavons, P.;
Bioinformatics and Bioengineering, 2007. BIBE 2007. Proceedings of the 7th IEEE International Conference on
14-17 Oct. 2007 Page(s):395 - 402
Abstract:

A common type of DNA variation is called a Single Nucleotide Polymorphism (SNP), where a single position within a DNA sequence is altered from one nucleotide base to another. The problem of identifying disease-associated SNPs has been the subject of extensive research by statisticians. However, less research has been done within the computing community. In this paper, we propose a novel geometrical computing model for the SNP Motif Identification Problem. The purpose of our research is to explore the properties of SNPs in a combinatorial way. We test our algorithm on two real clinical datasets, and give computational results which demonstrate the efficiency and effectiveness of our approach.
Abstract | Full Text: PDF(3473 KB)    IEEE CNF
 
» Key
IEEE JNL IEEE Journal or Magazine
IEE JNL IEE Journal or Magazine
IEEE CNF IEEE Conference Proceeding
IEE CNF IEE Conference Proceeding
IEEE STD IEEE Standard
 
 
Indexed by IEE Inspec
© Copyright 2009 IEEE – All Rights Reserved