![]() |
CiteULike | ![]() |
mpotamias's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Proximity Matching Using Fixed-Queries Treesedited by: M. Crochemore, D. GusfieldIn Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching, No. 807. (1994), pp. 198-212.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
Abstract. We present a new data structure, called the fixed-queries tree, for the problem of finding all elements of a fixed set that are close, under some distance function, to a query element. Fixedqueries trees can be used for any distance function, not necessarily even a metric, as long as it satisfies the triangle inequality. We give an analysis of several performance parameters of fixed-queries trees and experimental results that support the analysis. Fixed-queries trees are particularly...
BibTeX record
RIS record