Towards SNP calling in polyploid genomes

Authors

  • Anatoliy Dimitrov Faculty of Mathematics and Informatics, Sofia University “St. Kliment Ohridski”, Sofia
  • Milko Krachunov Faculty of Mathematics and Informatics, Sofia University “St. Kliment Ohridski”, Sofia
  • Ognyan Kulev Faculty of Mathematics and Informatics, Sofia University “St. Kliment Ohridski”, Sofia
  • Jérôme Salse INRA-UBP GDEC, Clermont-Ferrand
  • Irena Avdjieva AgroBioInstitute, Bioinformatics group, Sofia
  • Dimitar Vassilev AgroBioInstitute, Bioinformatics group, Sofia

DOI:

https://doi.org/10.14806/ej.21.A.826

Abstract

Polyploid genomes such as hexaploid wheat pose significant study challenges. The detection of SNPs is one of the problems that are difficult to solve. The existence of multiple subgenomes introduces a significant amount of natural noise for the SNP calling algorithms, and the expected occurrence rates of such SNPs is significantly lower than in diploid genomes. This makes them more difficult to distinguish from errors.

Downloads

Published

2015-03-25

Issue

Section

Posters