PMSeeker provides a scheme based on the greedy algorithm and the exhaustive algorithm to screen low-redundancy marker set for parentage assignment (PMS) of diploid species. The scheme can effectively reduce the number of markers needed in a parentage assignment. The exhaustive algorithm can find out the optimal PMS by traversing all marker combinations, and cannot handle more than 20 markers due to the huge number of combinations. Therefore, the greedy algorithm has to be adopted, though it is only capable of obtaining the local-optimal PMS. Detailed information about the two algorithms is available in introduction.pdf.
Data for peer review: article_data.zip
1. [Required] Upload the file for parent genotype information:
Note: This is a comma-delimited file, in which the genotypes of diploid markers are represented by '.A' and '.B' as in the example file.
2. [Optional] Upload the file specifying parent genders or families ( Gender Family ):
Note: The "Gender file" (example) is a TAB-delimited file with one column specifying the gender ("female" or "male") of parents in a random mating population; and the "Family file" (example) is TAB-delimited file where each row stands for one family.
Expected number of PMSs :
Maximum number of runs allowed for one PMS :
Minimum number of markers in a PMS :
Maximum number of markers in a PMS :
4. [Required] The email for receiving results :