Sorry if this question was already asked. I'm new to sequence analysis, I'm using TraMineR to analyze some sequences with the Optimal Matching. But I need to know the maximum possible cost that can result from using the OM.
I'm using an alphabet like: A,B,C,D,E,F and I have defined a substitution matrix.
Is there any way to know the maximum possible distance or cost of a sequence without creating all possible sequences of the alphabet?
Thanks in advance for your help.