By Topic

Genome on demand: interactive substring searching

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kahveci, T. ; Dept. of Comput. Sci., California Univ., Santa Barbara, CA, USA ; Singh, A.K.

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).

Published in:

Bioinformatics Conference, 2003. CSB 2003. Proceedings of the 2003 IEEE

Date of Conference:

11-14 Aug. 2003