Table of Contents
ISRN Bioinformatics
Volume 2013, Article ID 291741, 10 pages
http://dx.doi.org/10.1155/2013/291741
Research Article

HMEC: A Heuristic Algorithm for Individual Haplotyping with Minimum Error Correction

1Department of Computer Science, University of Texas at Austin, Austin, TX 78712, USA
2Department of Computer Science, Virginia Tech, Blacksburg, VA 24060, USA
3Department of Computer Science and Engineering, Univerity of California, Riverside, CA 92521, USA
4Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka 1000, Bangladesh

Received 26 November 2012; Accepted 12 December 2012

Academic Editors: A. Bolshoy and A. Torkamani

Copyright © 2013 Md. Shamsuzzoha Bayzid et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. Cilibrasi, L. V. Iersel, S. Kelk, and J. Tromp, “On the complexity of several haplotyping problems,” in Proceedings of the 5th International Workshop on Algorithms in Bioinformatics, vol. 3692 of Lecture Notes in Computer Science, pp. 128–139, Springer, 2005.
  2. P. Bonizzoni, G. Della Vedova, R. Dondi, and J. Li, “The haplotyping problem: an overview of computational models and solutions,” Journal of Computer Science and Technology, vol. 18, no. 6, pp. 675–688, 2003. View at Google Scholar · View at Scopus
  3. A. Chakravarti, “It's raining SNPs, hallelujah?” Nature Genetics, vol. 19, no. 3, pp. 216–217, 1998. View at Publisher · View at Google Scholar · View at Scopus
  4. R. Lippert, R. Schwartz, G. Lancia, and S. Istrail, “Algorithmic strategies for the single nucleotide polymorphism haplotype assembly problem,” Briefings in Bioinformatics, vol. 3, no. 1, pp. 23–31, 2002. View at Google Scholar · View at Scopus
  5. R. S. Wang, L. Y. Wu, Z. P. Li, and X. S. Zhang, “Haplotype reconstruction from SNP fragments by minimum error correction,” Bioinformatics, vol. 21, no. 10, pp. 2456–2462, 2005. View at Publisher · View at Google Scholar · View at Scopus
  6. V. Bansal and V. Bafna, “HapCUT: an efficient and accurate algorithm for the haplotype assembly problem,” Bioinformatics, vol. 24, no. 16, pp. i153–i159, 2008. View at Publisher · View at Google Scholar · View at Scopus
  7. J. Duitama, T. Huebsch, G. McEwen, E. K. Suk, and M. R. Hoehe, “ReFHap: a reliable and fast algorithm for single individual haplotyping,” in Proceedings of the ACM International Conference on Bioinformatics and Computational Biology (ACM-BCB '10), pp. 160–169, August 2010. View at Publisher · View at Google Scholar · View at Scopus
  8. C. M. Fiduccia and R. M. Mattheyses, “A linear time heuristics for improving network partitions,” in Proceedings of the 19th Design Automation Conference, pp. 175–181, 1982.
  9. L. M. Genovese, F. Geraci, and M. Pellegrini, “SpeedHap: an accurate heuristic for the single individual SNP haplotyping problem with many gaps, high reading error rate, and low coverage,” IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 5, no. 4, pp. 492–502, 2008. View at Publisher · View at Google Scholar · View at Scopus
  10. A. Panconesi and M. Sozio, “Fast hare: a fast heuristic for single individual SNP haplotype reconstruction,” Workshop on Algorithms in Bioinformatics, vol. 3240, pp. 266–277, 2004. View at Google Scholar · View at Scopus
  11. Y. Y. Zhao, L. Y. Wu, J. H. Zhang, R. S. Wang, and X. S. Zhang, “Haplotype assembly from aligned weighted SNP fragments,” Computational Biology and Chemistry, vol. 29, pp. 281–287, 2005. View at Google Scholar
  12. Y. Wang, E. Feng, and R. Wang, “A clustering algorithm based on two distance functions for MEC model,” Computational Biology and Chemistry, vol. 31, no. 2, pp. 148–150, 2007. View at Publisher · View at Google Scholar · View at Scopus
  13. Z. Chen, B. Fu, R. Schweller, B. Yang, Z. Zhao, and B. Zhu, “Linear time probabilistic algorithms for the singular haplotype reconstruction problem from SNP fragments,” Journal of Computational Biology, vol. 15, no. 5, pp. 535–546, 2008. View at Publisher · View at Google Scholar · View at Scopus
  14. F. Geraci, “A comparison of several algorithms for the single individual SNP haplotyping reconstruction problem,” Bioinformatics, vol. 26, no. 18, Article ID btq411, pp. 2217–2225, 2010. View at Publisher · View at Google Scholar · View at Scopus
  15. ReHap, http://bioalgo.iit.cnr.it/rehap/.
  16. A. Al Mueen, M. S. Bayzid, M. M. Alam, and M. S. Rahman, “A heuristic algorithm for individual haplotyping with minimum error correction,” in Proceedings of the 1st International Conference on BioMedical Engineering and Informatics (BMEI '08), pp. 792–796, IEEE Computer Society Press, May 2008. View at Publisher · View at Google Scholar · View at Scopus
  17. M. J. Rieder, S. L. Taylor, A. G. Clark, and D. A. Nickrson, “Sequence variation in the human angiotensin converting enzyme,” Nature Genetics, vol. 22, pp. 59–62, 1999. View at Google Scholar
  18. M. J. Daly, J. D. Rioux, S. F. Schaffner, T. J. Hudson, and E. S. Lander, “High-resolution haplotype structure in the human genome,” Nature Genetics, vol. 29, no. 2, pp. 229–232, 2001. View at Publisher · View at Google Scholar · View at Scopus
  19. S. Levy, G. Sutton, P. C. Ng, L Feuk, and A. L. Halpern, “The deploid genome sequence of an individual human,” PLOS Biology, vol. 5, no. 10, article e254, 2007. View at Publisher · View at Google Scholar
  20. X. S. Zhang, R. S. Wang, L. Y. Wu, and W. Zhang, “Minimum conflict individual haplotyping from SNP fragments and related genotype,” Evolutionary Bioinformatics, vol. 2, pp. 261–270, 2006. View at Google Scholar