Hi Pascal,
typically, constrained tree search runs faster, although the opposite is also possible - at least in
theory.
Could you please post both log files?
Best,
Alexey
On 24.10.19 20:21, Pascal Title wrote:
> Hi,
>
> I am running raxml-ng on a large sparse supermatrix. This supermatrix contains 7708 taxa and 8
> partitions. I find that on average a single raxml-ng run from a single starting tree, using 16
> threads, takes 1.5 weeks to complete.
>
> I am also running a parallel analysis with the same dataset, but where I am including a constraint
> tree with 1075 taxa (but otherwise everything else is identical). This run has been going for over
> 25 days.
>
> Is it normal for a constrained analysis to take so much longer than an unconstrained run? Or is this
> an indication of a problem?
>
> thanks!
>
> -Pascal
>
> --
> You received this message because you are subscribed to the Google Groups "raxml" group.
> To unsubscribe from this group and stop receiving emails from it, send an email to
> ra...@googlegroups.com <mailto:ra...@googlegroups.com>.
> ra...@googlegroups.com <mailto:ra...@googlegroups.com>.
raxmlHPC-PTHREADS-AVX -s gekko.phy -m GTRCAT -q concatenated.partitions.raxml.partitions -o Sphenodon_punctatus -g gekko.tre -T 10 -p 12345 -n gekkoTest raxml-ng --msa gekko.phy --model concatenated.partitions --prefix gekko --tree-constraint gekko.tre --threads 16 --seed 123 --tree rand{1}
raxmlHPC-PTHREADS-AVX -s gekko.phy -m GTRGAMMA -q concatenated.partitions.raxml.partitions -o Sphenodon_punctatus -g gekko.tre -T 10 -p 12345 -n gekkoTest