Keenhenry and his Web residence
Finding the longest common substring or common prefix or suffix of a group of strings is a common text processing problem. And it is a special case of edit distance problem.
This problem has a wide range of applications in different areas, i.e. computation biology and information retrieval from texts, and so on. I encountered this problem at work and I would like to give an extensive survey to this problem.
Read full article from Keenhenry and his Web residence
No comments:
Post a Comment