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
Volume , Issue , 14-17 Oct. 2007 Page(s):395 - 402
Digital Object Identifier   10.1109/BIBE.2007.4375593
Summary: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.

» View citation and abstract

Log in by entering your IEEE Web Account Username and Password.

IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.

• Search and access Abstract records free of charge
• Register for table of contents alerts
• Purchase Full Text PDF documents

» Learn more about subscription options or how to become an IEEE Member.