CiteULike is a free online bibliography manager. Register and you can start organising your references online.

Proximity Matching Using Fixed-Queries Trees Export

edited by: M. Crochemore, D. Gusfield

In Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching, No. 807. (1994), pp. 198-212.

Citation Format

[Posts]

View FullText article


mpotamias's tags for this article

nearest-neighbors proximity search trees

X Reviews [Write a review of this article]

X Find related articles from these CiteULike users

X Find related articles with these CiteULike tags

X Posting History

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


X BibTeX record

X RIS record


Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.