Neural Computing and Applications

, Volume 22, Issue 7–8, pp 1397–1405 | Cite as

Neural network-based approaches, solving haplotype reconstruction in MEC and MEC/GI models

  • M-Hossein Moeinzadeh
  • Ehsan AsgarianEmail author
  • Sarah Sharifian-R
Original Article


Single nucleotide polymorphism (SNP) in human genomes is considered to be highly associated with complex genetic diseases. As a consequence, obtaining all SNPs from human populations is one of the primary goals of recent studies on human genomics. The two sequences of SNPs in diploid human organisms are called haplotypes. In this paper, the problem of haplotype reconstruction from SNP fragments with and without genotype information is studied. Minimum error correction (MEC) is an important model for this problem but only effective when the error rate of the fragments is low. MEC/GI, as an extension to MEC model, employs the related genotype information besides the SNP fragments and, therefore, results in a more accurate inference. We introduce algorithmic neural network-based approaches and experimentally prove that our methods are fast and accurate. Particularly, our approach is faster, more accurate, and also compatible for solving MEC model, in comparison with a feed-forward (and back propagation like) neural network.


Biology and genomics Haplotype reconstruction SNP fragments Genotype information Clustering Unsupervised neural network 


  1. 1.
    Zhang X, Wang R, Wu L, Zhang W (2006) Minimum conflict individual haplotyping from SNP fragments and related Genotype. Evol Bioinformatics 2:271–280Google Scholar
  2. 2.
    Venter JC, Adams MD et al (2001) The sequence of the human genome. Science 291(5507):1304–1351CrossRefGoogle Scholar
  3. 3.
    Terwilliger J, Weiss K (1988) Linkage disequilibrium mapping of complex disease: fantasy and reality? Curr Opin Biotechnol 9:579–594Google Scholar
  4. 4.
    Chakravarti A It’s raining, hallelujah? Nat Genet 19:216–217Google Scholar
  5. 5.
    Wang R, Wu L, Li Z, Zhang X (2005) Haplotype reconstruction from SNP fragments by minimum error correction. Bioinformatics 21(10):2456–2462CrossRefGoogle Scholar
  6. 6.
    Bonizzoni P, Vedova GD, Dondi R, Li J (2003) The haplotyping problem: an overview of computational models and solutions. J Comput Sci Technol 18(6):675–688zbMATHCrossRefGoogle Scholar
  7. 7.
    Gusfield D (2001) Inference of haplotypes from samples of diploid populations: complexity and algorithms. J Comput Biol 8(3):305–323MathSciNetCrossRefGoogle Scholar
  8. 8.
    Gusfield D (2002) Haplotyping as perfect phylogeny: conceptual framework and efficient solution. In: Proceedings of the sixth annual international conference on computational biology. ACM Press, New York, pp 166–175Google Scholar
  9. 9.
    Wang LS, Xu Y (2003) Haploptye inference by maximum parsimony. Oxford J Bioinform 19(14):1773–1780CrossRefGoogle Scholar
  10. 10.
    Yuzhong Zh, Xu-Yun, Qiangfeng Zh, Guoliang Ch (2007) An overview of the haplotype problems and algorithms, 3rd edn, vol 1. Frontiers of Computer Science in China, Higher Education Press, Springer GmbH, pp 272–282Google Scholar
  11. 11.
    Zhang XS, Rui-Sh W, Wu L, Ling Y, Chen L (2006) Models and algorithms for haplotyping problem. Curr Bioinformatics 1(1):105–114Google Scholar
  12. 12.
    Marchini J, Cutler D, Patterson N, Stephens M, Eskin E, Halperin E, Lin S, Qin ZS, Munro HM, Abecasis GR, Donnelly P, International HapMap Consortium (2006) a comparison of phasing algorithms for trios and unrelated individuals. Am J Human Genet 78:437–450. (
  13. 13.
    Patil N, Berno AJ, Hinds DA et al (2001) Blocks of limited haplotype diversity revealed by high-resolution scanning of human chromosome 21. Science 294(5547):1719–1723CrossRefGoogle Scholar
  14. 14.
    Daly MJ, Rioux JD, Schaffner SF et al (2001) High-resolution haplotype structure in the human genome. Nat Genet 29:229–232CrossRefGoogle Scholar
  15. 15.
    Gabriel SB, Schaffner SF, Nguyen H et al (2002) The structure of haplotype blocks in the human genome. Science 296(5576):2225–2229CrossRefGoogle Scholar
  16. 16.
    Panconesi A, Sozio M (2004) Fast hare: a fast heuristic for single individual SNP haplotype reconstruction. In: Proceedings of 4th workshop on algorithms in bioinformatics (WABI), LNCS Springer, pp 266–277Google Scholar
  17. 17.
    Greenberg HJ, Hart EW, Lancia G (2004) Opportunities for combinatorial optimization in computational biology. INFORMS J Comput 16(3):211–231MathSciNetzbMATHCrossRefGoogle Scholar
  18. 18.
    Asgarian E et al (2008) Solving haplotype reconstruction problem in MEC model with hybrid information fusion, European symposium on computer modelling and simulationGoogle Scholar
  19. 19.
    Moeinzadeh M-H, Asgarian E et al (2007) Three heuristic clustering methods for haplotype reconstruction problem with genotype information, international conference on innovations in information technologyGoogle Scholar
  20. 20.
    Rieder M, Taylor S, Clark A, Nickerson D (1999) Sequence variation in the human angiotensin converting enzyme. Nat Genet 22:59–62CrossRefGoogle Scholar

Copyright information

© Springer-Verlag London Limited 2012

Authors and Affiliations

  • M-Hossein Moeinzadeh
    • 1
  • Ehsan Asgarian
    • 2
    Email author
  • Sarah Sharifian-R
    • 3
  1. 1.School of Mathematics, Statistics, and Computer ScienceUniversity of TehranTehranIran
  2. 2.Department of Computer EngineeringSharif University of TechnologyTehranIran
  3. 3.School of Mathematics, Statistics, and Computer ScienceTarbiat Modares UniversityTehranIran

Personalised recommendations