2009
DOI: 10.1007/978-3-642-00727-9_21
|View full text |Cite
|
Sign up to set email alerts
|

Selection of Multiple SNPs in Case-Control Association Study Using a Discretized Network Flow Approach

Abstract: Abstract. Recent large scale genome-wide association studies have been considered to hold promise for unraveling the genetic etiology of complex diseases. It becomes possible now to use these data to assess the influence of interactions from multiple SNPs on a disease. In this paper we formulate the multiple SNP selection problem for determining genetic risk profiles of certain diseases by formulating novel 0/1 IP formulations for this problem, and solving them using a new near-optimal and efficient discrete o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2010
2010
2015
2015

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 19 publications
0
3
0
Order By: Relevance
“…In Iso-PeptidAce, fragment ion patterns are reduced to a set of maximum network flow problems, for which a number of efficient algorithms are known 15 . This approach has previously been used in a wide range of complex problems, such as predicting molecular pathways in complex diseases or selecting single nucleotide polymorphisms and their associated alleles in patient and control groups 16 17 18 . In our study, we implemented the network flow approach to deconvolute composite fragment spectra of acetylated isomers.…”
Section: Resultsmentioning
confidence: 99%
“…In Iso-PeptidAce, fragment ion patterns are reduced to a set of maximum network flow problems, for which a number of efficient algorithms are known 15 . This approach has previously been used in a wide range of complex problems, such as predicting molecular pathways in complex diseases or selecting single nucleotide polymorphisms and their associated alleles in patient and control groups 16 17 18 . In our study, we implemented the network flow approach to deconvolute composite fragment spectra of acetylated isomers.…”
Section: Resultsmentioning
confidence: 99%
“…From the table we can see that the prediction accuracy is high (greater than 90%) under LOO. Finally, we compare our algorithm with several current methods including DNF [16], CGSP [19], RCGSP [19], CSP [18] and ORF [17]. The results of DNF were achieved by the 5-fold cross validation procedure, while the CGSP、RCGSP and CSP results were from LOO cross validation procedure.…”
Section: Resultsmentioning
confidence: 99%
“…Dutt formulated the multi-SNP selection problem as 0/1 integer programming problem, then solved them using a near-optimal technique called discretized network flow [16]. Mao and Lee used random forest to choose most disease-associated SNPs, and then selected SNPs used to build the optimal random forest to predict the disease status [17].…”
Section: Introductionmentioning
confidence: 99%