Genome on demand: interactive substring searching

Author

Kahveci, Tamer ; Singh, Ambuj K.

Author_Institution

Dept. of Comput. Sci., California Univ., Santa Barbara, CA, USA

fYear

2003

fDate

11-14 Aug. 2003

Firstpage

551

Lastpage

552

Abstract

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

Keywords

genetics; interactive systems; query formulation; search problems; user interfaces; genome demanding; global statistics-based interactive search; interactive substring searching; k-nearest neighbor; local statistics-based interactive search; search algorithms; Bioinformatics; Genomics;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Print_ISBN

0-7695-2000-6

Type

conf

DOI

10.1109/CSB.2003.1227405

Filename

1227405

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=397284