Is there a way to replicate Fitch parsimony in TreeSearch?

[HS6986]

Dear Professor Smith,

In my research, I would like to compare the results of Fitch parsimony and BGS parsimony. I realized that if I can replicate Fitch parsimony in TreeSearch, it will be beneficial in that it will allow me to unify parameter settings and be more scalable than analyzing results of software like TNT. Is there a way to do this? Although I have to admit that I don't understand Fitch parsimony and BGS parsimony in detail, but one way I've come up with is to replace all inapplicable states ($-$) in a matrix with missing states ($?$).

If this is not possible, it may be beneficial to add a Fitch parsimony option to TreeSearch, if possible.

I would greatly appreciate it if you could answer this question. Please feel free to point out any errors in my understanding.

[ms609]

Yes, replacing the inapplicable token $-$ with $?$ is a straightforward mechanism for accomplishing this.

[HS6986]

I appreciate your prompt reply. Thank you for providing this information!