• About
  • Policies
  • What is open access
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Uncovering complementary sets of variants for predicting quantitative phenotypes

      Thumbnail
      View / Download
      3.3 Mb
      Author(s)
      Yılmaz, S.
      Fakhouri, Mohamad
      Koyutürk, M.
      Çiçek, A. E.
      Taştan, Ö.
      Date
      2021-12-02
      Source Title
      Bioinformatics
      Print ISSN
      1367-4803
      Electronic ISSN
      1367-4811
      Publisher
      Oxford University Press
      Volume
      38
      Issue
      4
      Pages
      908 - 917
      Language
      English
      Type
      Article
      Item Usage Stats
      5
      views
      4
      downloads
      Abstract
      Motivation: Genome-wide association studies show that variants in individual genomic loci alone are not sufficient to explain the heritability of complex, quantitative phenotypes. Many computational methods have been developed to address this issue by considering subsets of loci that can collectively predict the phenotype. This problem can be considered a challenging instance of feature selection in which the number of dimensions (loci that are screened) is much larger than the number of samples. While currently available methods can achieve decent phenotype prediction performance, they either do not scale to large datasets or have parameters that require extensive tuning. Results: We propose a fast and simple algorithm, Macarons, to select a small, complementary subset of variants by avoiding redundant pairs that are likely to be in linkage disequilibrium. Our method features two interpretable parameters that control the time/performance trade-off without requiring parameter tuning. In our computational experiments, we show that Macarons consistently achieves similar or better prediction performance than state-ofthe-art selection methods while having a simpler premise and being at least two orders of magnitude faster. Overall, Macarons can seamlessly scale to the human genome with 107 variants in a matter of minutes while taking the dependencies between the variants into account. Availabilityand implementation: Macarons is available in Matlab and Python at https://github.com/serhan-yilmaz/macarons.
      Permalink
      http://hdl.handle.net/11693/111802
      Published Version (Please cite this version)
      https://doi.org/10.1093/bioinformatics/btab803
      Collections
      • Department of Computer Engineering 1561
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCoursesThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCourses

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 2976
      © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy