Efficient querying on genomic databases by using metric space indexing techniques

Authors:
Weimin Chen;K. Aberer
Affiliations:
-;-
Venue:
DEXA '97 Proceedings of the 8th International Workshop on Database and Expert Systems Applications
Year:
1997

Citing 0
Cited 3

String Matching with Metric Trees Using an Approximate Distance

SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Survey on index based homology search algorithms

The Journal of Supercomputing
The ND-tree: a dynamic indexing technique for multidimensional non-ordered discrete data spaces

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29

Quantified Score

Hi-index	0.00

Visualization

Abstract

A genomic database consists of a set of nucleotide sequences, for which an important kind of query is the focal sequence alignment. The paper investigates two different indexing techniques, namely the variations of GNAT trees and M-trees to support fast query evaluation for local alignment, by transforming the alignment problem to a variant metric space neighborhood search problem.