Skip to main content

An Ant-Colony Based Approach for Identifying a Minimal Set of Rare Variants Underlying Complex Traits

  • Conference paper
  • First Online:
  • 2077 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 10362))

Abstract

Identifying the associations between genetic variants and observed traits is one of the basic problems in genomics. Existing association approaches mainly adopt the collapsing strategy for rare variants. However, these approaches largely rely on the quality of variant selection, and lose statistical power if neutral variants are collapsed together. To overcome the weaknesses, in this article, we propose a novel association approach that aims to obtain a minimal set of candidate variants. This approach incorporates an ant-colony optimization into a collapsing model. Several classes of ants are designed, and each class is assigned to one particular interval in the solution space. An ant prefers to build optimal solution on the region assigned, while it communicates with others and votes for a small number of locally optimal solutions. This framework improves the performance on searching globally optimal solutions. We conduct multiple groups of experiments on semi-simulated datasets with different configurations. The results outperform three popular approaches on both increasing the statistical powers and decreasing the type-I and II errors.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Ropers, H.H.: New perspectives for the elucidation of genetic disorders. Am. J. Hum. Genet. 81(2), 199–207 (2007)

    Article  Google Scholar 

  2. Manolio, T.A., Collins, F.S., Cox, N.J.: Finding the missing heritability of complex diseases. Nature 461(7265), 747–753 (2009)

    Article  Google Scholar 

  3. Bodmer, W., Bonilla, C.: Common and rare variants in multifactorial susceptibility to common diseases. Nat. Genet. 40(6), 695–701 (2008)

    Article  Google Scholar 

  4. Li, B., Leal, S.M.: Methods for detecting associations with rare variants for common diseases: application to analysis of sequence data. Am. J. Hum. Genet. 83(3), 311–321 (2008)

    Article  Google Scholar 

  5. Madsen, B.E., Browning, S.R.: A groupwise association test for rare mutations using a weighted sum statistic. PLoS Genet. 5(2), e1000384 (2009)

    Article  Google Scholar 

  6. Sul, J.H., Han, B., He, D.: An optimal weighted aggregated association test for identification of rare variants involved in common diseases. Genetics 188(1), 181–188 (2011)

    Article  Google Scholar 

  7. Sul, J.H., Han, B., Eskin, E.: Increasing power of groupwise association test with likelihood ratio test. J. Comput. Biol. 18(11), 1611–1624 (2011)

    Article  MathSciNet  Google Scholar 

  8. Bhatia, G., Bansal, V., Harismendy, O.: A covering method for detecting genetic associations between rare variants and common phenotypes. PLoS Comput. Biol. 6(10), e1000954 (2010)

    Article  Google Scholar 

  9. Wang, J., Zhao, Z., Cao, Z., et al.: A probabilistic method for identifying rare variants underlying complex traits. BMC Genom. 14(Suppl 1), S11 (2013)

    Article  Google Scholar 

  10. Geng, Y., Zhao, Z., Zhang, X., et al.: An improved burden-test pipeline for cancer sequencing data. In: Bourgeois, A., Skums, P., Wan, X., Zelikovsky, A. (eds.) Bioinformatics Research & Applications ISBRA 2016. LNCS (LNBI), vol. 9683, pp. 314–315. Springer, Cham (2016)

    Google Scholar 

  11. Geng, Y., Zhao, Z., Cui, D., Zheng, T., Zhang, X., Xiao, X., Wang, J.: An Expanded Association Approach for Rare Germline Variants with Copy-Number Alternation. In: Rojas, I., Ortuño, F. (eds.) IWBBIO 2017. LNCS, vol. 10209, pp. 81–94. Springer, Cham (2017). doi:10.1007/978-3-319-56154-7_9

    Chapter  Google Scholar 

  12. Fréville, A.: The multidimensional 0–1 knapsack problem: an overview. Eur. J. Oper. Res. 155(1), 1–21 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  13. Yu, X.C., Zhang, T.W.: An improved ant algorithm for multidimensional knapsack problem. Chin. J. Comput. 31(5), 810–819 (2008)

    Article  MathSciNet  Google Scholar 

  14. Ji, J.Z., Huang, Z., Liu, C.N.: An ant colony optimization algorithm based on mutaion and phromone diffusion for the multidimensional knapsack problems. J. Comput. Res. Dev. 46(4), 644–654 (2009)

    Google Scholar 

  15. Gan, R.W.: Research on ant colony optimization and its application. Sun Yat-sen University, Guangzhou (2009)

    Google Scholar 

  16. Bansal, V., Libiger, O., Torkamani, A.: Statistical analysis strategies for association studies involving rare variants. Nat. Rev. Genet. 11(11), 773–785 (2010)

    Article  Google Scholar 

Download references

Acknowledgement

This work is supported by the National Science Foundation of China (Grant No: 81400632), Shaanxi Science Plan Project (Grant No: 2014JM8350) and the Fundamental Research Funds for the Central Universities (XJTU).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jiayin Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Zhang, X. et al. (2017). An Ant-Colony Based Approach for Identifying a Minimal Set of Rare Variants Underlying Complex Traits. In: Huang, DS., Jo, KH., Figueroa-García, J. (eds) Intelligent Computing Theories and Application. ICIC 2017. Lecture Notes in Computer Science(), vol 10362. Springer, Cham. https://doi.org/10.1007/978-3-319-63312-1_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-63312-1_30

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-63311-4

  • Online ISBN: 978-3-319-63312-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics