substring
sequence of characters that appear consecutively within a longer string.
n(n+1)/2
Subsequence
sequence of characters that appear in the same relative order but not necessarily consecutively within a string.
2^n
leaves on tree for 2 strings
m+n
inner nodes on tree for 2 strings
m+n-1
The weight vector is a linear combination of all training data.
true
The larger the regularization parameter C the harder the hyperplane
true