Sharing the components of transposition-invariant distance, DIT, on DIT-organized Burkhard-Keller structure in searches for best matching strings

摘要

Various construction approaches for character/frequency information sharing structures are proposed to optimize transportation-invariant distance evaluation. An approach for Burkhard-Keller tree construction according to the sharing structure is proposed. Experimental results are presented.