Genome on demand: interactive substring searching

We consider the problem of interactive string searching, and propose two k-NN (k-nearest neighbor) search algorithms. For a given query, our techniques start reporting the initial results quickly. Later, these results are periodically refined depending on the user satisfaction. We briefly discuss the two techniques. The first technique, called LIS (Local statistics-based Interactive Search),and the second technique, called GIS (Global Statistics-based Interactive Search).