when I run LCS dynammic programming, I got a table. In this table I
got all information about the longest common substring. qestion is :
if the longest common substring is not single, for example there are
two , three or more longest common substring are found,how can I get
all these subtring.
thank you