Hi Breanna,
in general, you can use the "-f a" option to run this "all-in-one" analysis (ML tree search + rapid bootstrapping +
bootstrap bipartition support mapped to the best-found ML tree).
But you can also obtain the bipartition support from your existing output files, please see detailed explanations
between the lines:
> It was my assumption that if no -f was specified RAxML would execute the standard hill climbing algorithm (-f d).
It is generally true, but there are few exceptions, including "-x" and "-b" options.
> I have run RAxML before under this assumption (w/o including the -f option), & it ran as expected. However, more recently,
> RAxML appeared to quit after executing rapid bootstrapping & writing my 1000 bootstrapped trees.
>
> I called RAxML as follows:
>
> |
> raxmlHPC-PTHREADS-AVX2 -T 20-m PROTCATBLOSUM62 -n OUTPUTNAME -s ALIGNMENT -# 1000 -p 12345 -x 12345
> |
>
> The final lines in my *info* are:
>
> |
> OverallTimefor1000RapidBootstraps36326.376972seconds
> AverageTimeper RapidBootstrap36.326377seconds
> All1000bootstrapped trees written to:RAxML_bootstrap.OUTPUTNAME
> |
>
> Did RAxML not finish because I didn't include -f d? I received no error messages.
RAxML did finish successfully and generated rapid bootstrap trees.
>Can I execute a thorough tree search
> on those bootstrapped trees & generate the RAxML bipartition files? I tried including -f T -t
> RAxML_bootstrap.OUTPUTNAME, but it appears this only gives me a RAxML_bestTree.*
This is also intended behavior. Now you just need to run one extra command to map BS support values to the best ML tree
("-f b" option):
|
raxmlHPC-AVX2 -f b -t RAxML_bestTree.OUTPUTNAME -z RAxML_bootstrap.OUTPUTNAME -m GTRGAMMA -n SUPPORT
|
Please also refer to the RAxML manual which describes what each particular command line option is doing exactly:
https://sco.h-its.org/exelixis/resource/download/NewManual.pdf
Hope it helps,
Alexey