Efficient Algorithms for the Two Locus Problem in Genome-Wide Association Study: Algorithms for the Two Locus Problem.
Sanguthevar Rajasekaran|Subrata Saha
| Anthology ID: | DBLP:conf/cikm/RajasekaranS16 |
|---|---|
| Volume: | Proceedings of the 25th ACM International Conference on Information and Knowledge Management, CIKM 2016, Indianapolis, IN, USA, October 24-28, 2016 |
| Year: | 2016 |
| Venue: | International Conference on Information and Knowledge Management (CIKM) |
| Publisher: | ACM |
| Pages: | 2305-2310 |
| URL: | https://doi.org/10.1145/2983323.2983685 |
| DOI: | https://doi.org/10.1145/2983323.2983685 |
| DBLP: | conf/cikm/RajasekaranS16 |
| BibTeX: |
@inproceedings{rajasekaran-2016-efficient,
author = {Sanguthevar Rajasekaran and
Subrata Saha},
editor = {Snehasis Mukhopadhyay and
Javed Mostafa and
ChengXiang Zhai and
Elisa Bertino and
Fabio Crestani and
Javed Mostafa and
Jie Tang and
Luo Si and
Xiaofang Zhou and
Yi Chang and
Yunyao Li and
Parikshit Sondhi},
title = {{Efficient Algorithms for the Two Locus Problem in Genome-Wide Association Study: Algorithms for the Two Locus Problem}},
booktitle = {{Proceedings of the 25th ACM International Conference on Information and Knowledge Management, CIKM 2016, Indianapolis, IN, USA, October 24-28, 2016}},
pages = {2305--2310},
publisher = {ACM},
year = {2016},
url = {https://doi.org/10.1145/2983323.2983685},
doi = {https://doi.org/10.1145/2983323.2983685}
}