3. The similarity search initialization system of claim 2 , wherein the selected leaf is a sibling leaf of a leaf of the suffix tree, the leaf representing the query string suffix, and wherein the candidate substring is a substring of the target string that begins at a location in the target string given by the selected leaf minus a difference between a length of the query string and a length of the query string suffix.
3. The similarity search initialization system of claim 2 , wherein the selected leaf is a sibling leaf of a leaf of the suffix tree, the leaf representing the query string suffix, and wherein the candidate substring is a substring of the target string that begins at a location in the target string given by the selected leaf minus a difference between a length of the query string and a length of the query string suffix. 4. The similarity search initialization system of claim 3 , wherein the selected leaf is a left-most sibling leaf of the leaf representing the query string suffix.