A New Family of String Classifiers Based on Local Relatedness

This paper introduces a new family of string classifiers based on local relatedness. We use three types of local relatedness measurements, namely, longest common substrings (LCStr's), longest common subsequences (LCSeq's), and window-accumulated longest common subsequences (wLCSeq's). We show that finding the optimal classier for given two sets of strings (the positive set and the negative set), is NP-hard for all of the above measurements. In order to achieve practically efficient algorithms for finding the best classifier, we investigate pruning heuristics and fast string matching techniques based on the properties of the local relatedness measurements.

• Type: Conference
• Year: 2006
• Where: DIS
• Authors: Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
• Keywords: DIS 2006, Local Relatedness, Local Relatedness Measurements, Longest Common Subsequences, Theoretical Computer Science