title: Efficient techniques for genotype-phenotype correlational analysis.
abstract: BACKGROUND
  Single Nucleotide Polymorphisms (SNPs) are sequence variations found in individuals at some specific points in the genomic sequence. As SNPs are highly conserved throughout evolution and within a population, the map of SNPs serves as an excellent genotypic marker. Conventional SNPs analysis mechanisms suffer from large run times, inefficient memory usage, and frequent overestimation. In this paper, we propose efficient, scalable, and reliable algorithms to select a small subset of SNPs from a large set of SNPs which can together be employed to perform phenotypic classification.
  
  
  METHODS
  Our algorithms exploit the techniques of gene selection and random projections to identify a meaningful subset of SNPs. To the best of our knowledge, these techniques have not been employed before in the context of genotype-phenotype correlations. Random projections are used to project the input data into a lower dimensional space (closely preserving distances). Gene selection is then applied on the projected data to identify a subset of the most relevant SNPs.
  
  
  RESULTS
  We have compared the performance of our algorithms with one of the currently known best algorithms called Multifactor Dimensionality Reduction (MDR), and Principal Component Analysis (PCA) technique. Experimental results demonstrate that our algorithms are superior in terms of accuracy as well as run time.
  
  
  CONCLUSIONS
  In our proposed techniques, random projection is used to map data from a high dimensional space to a lower dimensional space, and thus overcomes the curse of dimensionality problem. From this space of reduced dimension, we select the best subset of attributes. It is a unique mechanism in the domain of SNPs analysis, and to the best of our knowledge it is not employed before. As revealed by our experimental results, our proposed techniques offer the potential of high accuracies while keeping the run times low.
authors.affiliation: Department of Computer Science and Engineering, University of Connecticut, Storrs, Connecticut, USA.
authors.forename: Subrata
authors.initials: S
authors.lastname: Saha
authors.forename: Sanguthevar
authors.initials: S
authors.lastname: Rajasekaran
authors.forename: Jinbo
authors.initials: J
authors.lastname: Bi
authors.forename: Sudipta
authors.initials: S
authors.lastname: Pathak
mesh_terms: D000465:Algorithms; D056726:Genetic Association Studies; D006801:Humans; D058011:Multifactor Dimensionality Reduction / Q000379:methods*; D020641:Polymorphism, Single Nucleotide; D025341:Principal Component Analysis
references.citation: Am J Hum Genet. 2001 Jul;69(1):138-47
references.pmid: 11404819
references.citation: Clin Cancer Res. 2004 Apr 15;10(8):2725-37
references.pmid: 15102677
references.citation: Am J Hum Genet. 2003 Jul;73(1):115-30
references.pmid: 12796855
references.citation: Science. 1997 Nov 28;278(5343):1580-1
references.pmid: 9411782
references.citation: BMC Bioinformatics. 2004 Apr 30;5:49
references.pmid: 15119966
references.citation: Genet Epidemiol. 2004 Jan;26(1):11-21
references.pmid: 14691953
references.citation: IEEE Trans Neural Netw. 2002;13(2):415-25
references.pmid: 18244442
references.citation: Bioinformatics. 2003 Feb 12;19(3):376-82
references.pmid: 12584123
references.citation: Hum Genet. 1985;69(3):201-5
references.pmid: 2984104
references.citation: Genet Epidemiol. 2003 Feb;24(2):150-7
references.pmid: 12548676
references.citation: Nat Rev Genet. 2002 May;3(5):391-7
references.pmid: 11988764
references.citation: Bioinformatics. 2007 Oct 1;23(19):2507-17
references.pmid: 17720704
references.citation: Pharmacogenomics. 2006 Apr;7(3):475-83
references.pmid: 16610957
references.citation: Alcohol Alcohol. 2008 Sep-Oct;43(5):505-15
references.pmid: 18477577
references.citation: Nat Genet. 2008 May;40(5):646-9
references.pmid: 18425127
references.citation: Genet Epidemiol. 2006 Feb;30(2):111-23
references.pmid: 16374833