Number of distinct subsequences in a sequence.
Computes the number of distinct subsequences in a sequence using Elzinga's algorithm.
a state sequence object as defined by the
The function first searches for missing states in the sequences and if found, adds the missing state to the alphabet for the extraction of the distinct subsequences. A missing state in a sequence is considered as the occurrence of an additional symbol of the alphabet, and two or more consecutive missing states are considered as two or more occurrences of the same state. The
with.missing=TRUE argument is used for calling the
seqdss function when
Vector with the number of distinct subsequences for each sequence in the input state sequence object.
Alexis Gabadinho (with Gilbert Ritschard for the help page)
1 2 3 4 5 6 7 8