Referenced Items are not available for this document.
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
- Page(s):
- 551 - 552
- Print ISBN:
- 0-7695-2000-6
- INSPEC Accession Number:
- 7906398
- Digital Object Identifier :
- 10.1109/CSB.2003.1227405
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
