
26 Jan
2005
26 Jan
'05
11:37 a.m.
Hihi, I'm working on a problem. I found buddy wearing ACM T-Shirt(World final, so cool!). So I post it here thinking maybe you can give me some hints. It's described as following: Given a string and a pool of strings, find which string in pool is best matched the given one. I know I can use dynamic programming to find out the largest common substring of two strings. But how to apply on my problem? GUO Zhijun jamguo(a)sh163.net