Content deleted Content added
→top: use indefn. article when multiple solutions are possible |
|||
Line 32:
The following pseudocode finds the set of longest common substrings between two strings with dynamic programming:
'''function'''
L := '''array'''(1..r, 1..n)
z := 0
| |||