Published in Proc. of 8th International Conference and Workshop on Database and Expert Systems Application, DEXA 97. (1997)
by
Efficient Querying On
BibTeX
@MISC{On97publishedin,
author = {Efficient Querying On},
title = {Published in Proc. of 8th International Conference and Workshop on Database and Expert Systems Application, DEXA 97.},
year = {1997}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A genomic database consists of a set of nucleotide sequences, for which an important kind of queries is the local sequence alignment. This paper investigates two different indexing techniques, namely the variations of GNAT trees [1] and M-trees [3], to support fast query evaluation for local alignment, by transforming the alignment problem to a variant metric space neighborhood search problem. 1
Citations
| 447 | M-tree: an efficient access method for similarity search in metric spaces - Ciaccia, Patella, et al. - 1997 |
| 142 | Satisfying general proximity/similarity queries with metric trees - Uhlmann - 1991 |
| 15 | Indexing nucleotide databases for fast query evaluation - Williams, Zobel - 1996 |
| 10 | Near Neighbor Search - Brin - 1995 |
| 9 | Linear-Space Algorithms that Build Local Alignments from Fragments - Chao, Miller - 1995 |
