Near merging of paths in suboptimal tree searching (Corresp.)

The near merging of paths in tree searching is explored. This near merging can degrade coding performance when a suboptimal search algorithm is used. The problem is first identified and then a feasible solution is presented. Some examples from image source coding using the
(M, L)
algorithm are given.