Fandom

VroniPlag Wiki

Ib/Fragment 050 01

< Ib

31.268Seiten in
diesem Wiki
Seite hinzufügen
Diskussion0 Share

Störung durch Adblocker erkannt!


Wikia ist eine gebührenfreie Seite, die sich durch Werbung finanziert. Benutzer, die Adblocker einsetzen, haben eine modifizierte Ansicht der Seite.

Wikia ist nicht verfügbar, wenn du weitere Modifikationen in dem Adblocker-Programm gemacht hast. Wenn du sie entfernst, dann wird die Seite ohne Probleme geladen.


Typus
Verschleierung
Bearbeiter
SleepyHollow02
Gesichtet
No.png
Untersuchte Arbeit:
Seite: 50, Zeilen: 1-11
Quelle: Mohamed 2009
Seite(n): 46, Zeilen: 1ff.
3.3 Population structure and Kinship coefficients

The Population structure analysis was conducted using genotypic data of 895 DArT markers by using Structure Software 2.2 (Pritchard et al 2000), and the accessions subdivided into 16 subpopulations, base on the suggestion of Pritchard and Wen (2007), by using the burn-in time 100 000 and the number of replications (MCMC) was 200 000, the individuals placed into k clusters, we set k (the number of subpopulations) from 1 to 22. To reach the appropriate K value, the estimated normal logharithm of the probability of fit (averaged for the two runs), the population structure matrix (Q) was defined by running structure at K = 16, where the highest likelihood has been obtained (Fig.10a).

Fig. (10) (a) presents the number of clusters, which have the highest maximum likelihood, and (b) presents the percentage of the accessions in each cluster.

3.3 Population structure and Kinship coefficients

The Population structure analysis was conducted using genotypic data of 1081 DArT markers by using Structure Software 2.2 (Pritchard et al 2000), and the accessions subdivided into 12 subpopulations, base on the suggestion of Pritchard and Wen (2007), we used the burn-in time 50 000 and the number of replications (MCMC) was 100 000, the individuals placed into k clusters, we set k (the number of subpopulations) from 2 to 15 and performed 14 runs for k values, the population structure matrix (Q) was defined by running structure at K = 12 , where the highest likelihood has been obtained (Fig.3a).

Fig.3 (a) presents the number of clusters, which have the highest maximum likelihood, and (b) presents the percentage of the accessions in each cluster.

Anmerkungen
Sichter
(SleepyHollow02)

Auch bei Fandom

Zufälliges Wiki