Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Optim Lett

Search In Journal Title:

Abbravation: Optimization Letters

Search In Journal Abbravation:

Publisher

Springer-Verlag

Search In Publisher:

DOI

10.1007/s10489-008-0154-7

Search In DOI:

ISSN

1862-4480

Search In ISSN:
Search In Title Of Papers:

Selection of representative SNP sets for genomewi

Authors: Gürkan Üstünkar Süreyya ÖzöğürAkyüz Gerhard W Weber Christoph M Friedrich Yeşim Aydın Son
Publish Date: 2011/11/01
Volume: 6, Issue: 6, Pages: 1207-1218
PDF Link

Abstract

After the completion of Human Genome Project in 2003 it is now possible to associate genetic variations in the human genome with common and complex diseases The current challenge now is to utilize the genomic data efficiently and to develop tools to improve our understanding of etiology of complex diseases Many of the algorithms needed to deal with this task were originally developed in management science and operations research OR One application is to select a subset of the Single Nucleotide Polymorphism SNP biomarkers from the whole SNP set that is informative and small enough for subsequent association studies In this paper we present an OR application for representative SNP selection that implements our novel Simulated Annealing SA based featureselection algorithm We hope that our work will facilitate reliable identification of SNPs that are involved in the etiology of complex diseases and ultimately support timely identification of genomic disease biomarkers and the development of personalizedmedicine approaches and targeted drug discoveriesFor the Alzheimer’s Disease Neuroimaging Initiative Data used in preparation of this article were obtained from the Alzheimer’s Disease Neuroimaging Initiative ADNI database adniloniuclaedu As such the investigators within the ADNI contributed to the design and implementation of ADNI and/or provided data but did not participate in analysis or writing of this report A complete listing of ADNI investigators can be found at http//adniloniuclaedu/wpcontent/uploads/how to apply/ADNI Acknowledgement Listpdf


Keywords:

References


.
Search In Abstract Of Papers:
Other Papers In This Journal:

  1. An interior penalty method for a finite-dimensional linear complementarity problem in financial engineering
  2. The modified proximal point algorithm in CAT(0) spaces
  3. An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
  4. A semidefinite optimization approach to the Target Visitation Problem
  5. Elementary convex techniques for equilibrium, minimax and variational problems
  6. On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients
  7. Symmetric duality for second-order fractional programs
  8. Generalized solutions of quasi variational inequalities
  9. A composite model in the context of a production-inventory system
  10. Preserving maximal monotonicity with applications in sum and composition rules
  11. Single machine serial-batching scheduling with independent setup time and deteriorating job processing times
  12. Strong convergence of Mann’s type iteration method for an infinite family of generalized asymptotically nonexpansive nonself mappings in Hilbert spaces
  13. Stochastic subgradient descent method for large-scale robust chance-constrained support vector machines
  14. Polynomial-time identification of robust network flows under uncertain arc failures
  15. A multi-space sampling heuristic for the vehicle routing problem with stochastic demands
  16. Maximizing strike aircraft planning efficiency for a given class of ground targets
  17. Dynamic lot-sizing problem with demand time windows and container-based transportation cost
  18. Sufficient conditions for protection routing in IP networks
  19. A note on diameters of point sets
  20. Capacity optimization through sensing threshold adaptation for cognitive radio networks
  21. Convexifying the set of matrices of bounded rank: applications to the quasiconvexification and convexification of the rank function
  22. The perspective of a bank in granting credits: an optimization model
  23. k -Sum decomposition of strongly unimodular matrices
  24. Solving the weighted MAX-SAT problem using the dynamic convexized method
  25. Locating facilities in a competitive environment
  26. A comparison of several nearest neighbor classifier metrics using Tabu Search algorithm for the feature selection problem
  27. Global optimal approximate solutions

Search Result: