Closed thyme0425 closed 1 year ago
Hi There,
It looks like the likelihood for each test point is the same. So the optimization terminates at the default initial value.
Could you send me your input files so I can try to figure out why that's happening?
Thanks,
Russ
Here attached are my input file and ploidy file. Thanks! input_file.txt ahmm.ploidy.txt
Good news: I can reproduce your results. Thanks for providing the files!
Bad news: I don't think ancestry_hmm is the ideal program for your analysis. Your reference panels are very small (2 chromosomes in each). This combined with an ancient admixture time means it is likely to perform poorly. The reason the program arrives at the same outcome in each bootstrap is that the likelihood surface is very flat, and the two test points are sufficiently close that optimization terminates.
Thank you very much for your reply! I will try to increase my sample size to see if ancestry_hmm can perform better. For now I wonder if you could recommend some softwares if I want to estimate introgression time based on very small sample size and/or ancient admixture time.
Ancient admixture with few samples is a hard problem
Treemix might be helpful?
If you have an outgroup species or two, maybe you could use d-statistics or d-foil for part of your analysis?
Hi, I'm using a single pulse admixture model to estimate the admixture time from one species to the admixed species. I got only one sample per species. When I was running Ancestry_HMM using the following command:
ancestry_hmm -i input_file -s ahmm.ploidy -a 2 0.95 0.05 -p 0 3450000 0.95 -p 1 -100 0.05 -g -e 1e-4 -b 100 1000
The estimate time was 10000 for every bootstrap as is shown below:
So I was wondering if Ancestry_HMM has a upper limit of 10000 generations. I tried to set the --tmax parameter to 100000/500000, but I got the following result with the same estimate time for each bootstrap:
The output on the screen looks like:
I can not figure out why I got this result, and I'm wondering if Ancestry_HMM is applicable to my dataset. Many thanks!