SHARING THE COMPONENTS OF TRANSPOSITION-INVARIANT DISTANCE, DIT, ON DIT-ORGANIZED BURKHARD-KELLER STRUCTURE IN SEARCHES FOR BEST MATCHING STRINGS

In this work various construction character/frequency information sharing structure approaches are proposed in order to optimize transposition_invariant distance evaluation, [SD87], that distance is used to construct a Burkhard-keller tree, [BK73] and [NK82], where is organized a dictionary of strings token over a characters alphabet [SP88], to achieve searchings of strings best matching one on Levenshtein sense [LE66]. This work is on the line of optimizing search schemes for the strings best matching one and data structures standing them. Given