AN ANALOGY OF ALGORITHMS FOR TAGGING OF SINGLE NUCLEOTIDE POLYMORPHISM AND EVALUATION THROUGH LINKAGE DISEQUILIBRIUM

Authors

  • Moitree Basu Tata Consultancy Services, India. Author
  • Pradipta Deb Tata Consultancy Services, India. Author

Keywords:

Explosive Growth, Revolutionary Technologies, Small Efficient Dataset

Abstract

Recent years have seen an explosive growth in biological data. It should be managed and stored for various purposes. Demand has never been greater for revolutionary technologies that deliver fast, inexpensive and accurate and easy to comprehend genome information. Here comes the relevance of tagging data. From huge large DNA sequence information scientists needed some small efficient dataset that they can do their research on and that is exactly why some optimization needed to be carried upon these big data. A subset of SNPs that are selected to represent the original information embedded in the full set of SNPs is referred to as the set of Tag SNPs. Large sequencing projects are producing increasing quantities of nucleotide sequences. The contents of nucleotide databases are doubling in size approximately every fourteen months. So to track and analyze this amount of data scientists need some small set of data that can represent the whole database characteristically. So computer scientists came up with some innovative algorithms to find tag SNPs. We have done a comparative study by implementing the popular algorithms and evaluating them by scoring Linkage Disequilibrium

 

References

Halldórsson BV, Bafna V, Lippert R, Schwartz R, Vega FM, ClarkAG,Istrail S: Optimal haplotype block-free selection of tagging SNPs for genome-wide association studies. Genome Research2004:1633-1640.

Carlson CS, Eberle MA, Rieder MJ, Yi Q, Kruglyak L, Nickerson DA:Selecting a maximally informative set of single-nucleotide polymorphisms for association analyses using linkage disequilibrium.

Daly MJ, Rioux JD, Schaffner SF, Hudson TJ, Lander ES: High-resolution haplotype structure in the human genome. Nat Genet2001, 29(2):229-232.

Cormen TH, Leiserson CE, Rivest RL, Stein C: Introduction to algorithms The MIT Press; 2001.

McCluskey E. Minimization of Boolean Functions. Bell System Technical Journal. 1956; 35:1417–1444.

Tomaszewski, S. P., Celik, I. U., Antoniou, G. E., "WWW-based Boolean function minimization" INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS AND COMPUTER SCIENCE, VOL 13; PART 4, pages 577-584, 2003.

Zhang K, Qin ZS, Liu JS, Chen T, Waterman MS, Sun F: Haplotype block partition and tag SNP selection using genotype data and their applications to association studies. Genome Research 2004, 14:908-916.

Zhao JH, Lissarrague S, Essioux L, Sham PC: GENECOUNTING: haplotype analysis with missing genotypes. Bioinformatics 2002, 18:1694-1695.

B. Devlin, and N. Risch. A comparison of linkage disequilibrium measures for fine-scale mapping. Genomics.29, 311–322, 1995.

B. Halldórsson, V. Bafna, R. Lippert, R. Schwartz, F. de la Vega, A. Clark, and S. Istrail. Optimal haplotype block-free selection of tagging snps for genome-wide association studies. Genome research.14, 1633-1640, 2004.

Z. Meng, D. Zaykin, C. Xu, M. Wagner, and M. Ehm. Selection of genetic markers for association analyses, using linkage disequilibrium and haplotypes. Am. J. Hum. Genet. 73: 115–130, 2003.

He, J. and Zelikovsky, A. (2004) ‘Linear Reduction Methods for Tag SNP Selection’, Proceedings of the International Conference of the IEEE Engineering in Medicine and Biology (EMBC’04), pp. 2840–2843.

Zhang, K., Qin, Z., Liu, J., Chen, T., Waterman, M., and Sun, F. (2004) ‘Haplotype block partitioning and tag SNP selection using genotype data and their applications to association studies’, Genome Research, Vol. 14, pp. 908–916.

Jingwu He, Kelly Westbrooks and Alexander Zelikovsky ‘Linear Reduction Method for Predictive and Informative Tag SNP Selection’ Proceedings of the International Conference of the IEEE Engineering in Medicine and Biology (EMBC’09)

Tu Minh Phuong , Zhen Lin Russ B. Altman ‘Choosing SNPs Using Feature Selection’ 2005 IEEE Computational Systems Bioinformatics Conference (CSB’05)

H. J. Greenberg, W. E. Hart, and G. Lancia, “Opportunities for combinatorial optimization in computational biology.,” IN- FORMS Journal on Computing, Vol. 16, No. 3, pp. 211–231, 2004.

Shambhavi.B.R and Dr.Ramakanth Kumar.P, “Current State of the Art Pos Tagging for Indian Languages – A Study”, International Journal of Computer Engineering & Technology (IJCET), Volume 1, Issue 1, 2010, pp. 250 - 260, ISSN Print: 0976 – 6367, ISSN Online: 0976 – 6375.

Moitree Basu and Pradipta Deb, “Tag SNP Selection using Quine-Mccluskey Optimization Method”, International Journal of Advanced Research in Engineering & Technology (IJARET), Volume 4, Issue 5, 2013, pp. 74 - 81, ISSN Print: 0976-6480, ISSN Online: 0976- 6499.

Downloads

Published

2019-12-13

How to Cite

AN ANALOGY OF ALGORITHMS FOR TAGGING OF SINGLE NUCLEOTIDE POLYMORPHISM AND EVALUATION THROUGH LINKAGE DISEQUILIBRIUM. (2019). INTERNATIONAL JOURNAL OF CHEMISTRY RESEARCH AND DEVELOPMENT (IJCRD), 1(1), 58-67. https://iaeme-library.com/index.php/IJCRD/article/view/IJCRD_01_01_009