-
To match every feature set on the horizontal axis(asymmetric
form), it is enough if one compares all the rows of the
previous column alone,taking the global constraints into
account
-
To find the minimum cost for matching t(i) and r(j) requires a
set of predecessors to be matched to the required set of
features which can be done recursively as