Display options
Share it on

J Appl Crystallogr. 2016 Apr 12;49:756-761. doi: 10.1107/S1600576716004039. eCollection 2016 Jun 01.

[No title available]

Journal of applied crystallography

Lawrence C Andrews, Herbert J Bernstein

Affiliations

  1. 9515 NE 137th Street, Kirkland, WA 98034, USA.
  2. School of Chemistry and Materials Science, Rochester Institute of Technology, Rochester, NY 14623, USA.

PMID: 27275134 PMCID: PMC4886977 DOI: 10.1107/S1600576716004039

Abstract

Many problems in crystallography and other fields can be treated as nearest-neighbor problems. The neartree data structure provides a flexible way to organize and retrieve metric data. In some cases, it can provide near-optimal performance.

Keywords: nearest-neighbor search; neartree data structure; post office problem

References

  1. IEEE Trans Pattern Anal Mach Intell. 2014 Nov;36(11):2227-40 - PubMed
  2. J Appl Crystallogr. 2016 Apr 12;49(Pt 3):756-761 - PubMed
  3. Trends Biochem Sci. 2000 Sep;25(9):453-5 - PubMed
  4. J Appl Crystallogr. 2010 Apr 1;43(Pt 2):356-361 - PubMed
  5. J Appl Crystallogr. 2014 Jan 30;47(Pt 1):346-359 - PubMed
  6. J Appl Crystallogr. 2014 Jan 30;47(Pt 1):360-364 - PubMed
  7. EMBO J. 2001 Aug 1;20(15):4214-21 - PubMed
  8. Sci Am. 1966 Jun;214(6):42-52 - PubMed

Publication Types

Grant support