i have representation of object being example subobjects: h1,h2,f1,f2 each of h anf f represent specific smaller object. wish query check representations have 3 of subobject in common eg h1,h4,f1,f2 returned back, h1,h2,f1,f5. when query objects have 3 parts of string representation in common h1,h2,f1,f2.
the string position important therefore h2,h1,f1,f2 different h1,h2,f1,f2.
a brute force plan of action not possible have thousands of such strings compare. thinking of way hacking round problem use of suffix trees.
is there more efficient data structure can use solve problem?
as stated in question resorted use suffix trees. such trees let me query tree rapidly particular substrings , objects contain particular substring. dont know if better solution exists suffix trees worked problem. suffix trees:
Comments
Post a Comment