Figure 4

Singlebit tree. Example of a Singlebit tree. The black squares mark the bits chosen for the given node, while the grey squares mark bits chosen at an ancestor. The grey triangles represent subtrees omitted to keep this example simple. Assume we are searching for the bitstring A in the example. When examining the node marked by the arrow we have the knowledge shown in B^? about all children of that node. Comparing A against B^? gives us m₀₀ = 0, m₀₁ = 0, m₁₀ = 1 and m₁₁ = 2. Thus . Indeed we find that S _T (A, B) = and S _T (A, B') = .