|
|
|
|
LEADER |
01000caa a22002652 4500 |
001 |
NLM261173189 |
003 |
DE-627 |
005 |
20250220062431.0 |
007 |
tu |
008 |
231224s2016 xx ||||| 00| ||eng c |
028 |
5 |
2 |
|a pubmed25n0870.xml
|
035 |
|
|
|a (DE-627)NLM261173189
|
035 |
|
|
|a (NLM)27275134
|
040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
041 |
|
|
|a eng
|
100 |
1 |
|
|a Andrews, Lawrence C
|e verfasserin
|4 aut
|
245 |
1 |
0 |
|a NearTree, a data structure and a software toolkit for the nearest-neighbor problem
|
264 |
|
1 |
|c 2016
|
336 |
|
|
|a Text
|b txt
|2 rdacontent
|
337 |
|
|
|a ohne Hilfsmittel zu benutzen
|b n
|2 rdamedia
|
338 |
|
|
|a Band
|b nc
|2 rdacarrier
|
500 |
|
|
|a Date Revised 09.01.2021
|
500 |
|
|
|a published: Electronic-eCollection
|
500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
520 |
|
|
|a 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. NearTree is a software tool that constructs neartrees and provides a number of different query tools
|
650 |
|
4 |
|a Journal Article
|
650 |
|
4 |
|a nearest-neighbor search
|
650 |
|
4 |
|a neartree data structure
|
650 |
|
4 |
|a post office problem
|
700 |
1 |
|
|a Bernstein, Herbert J
|e verfasserin
|4 aut
|
773 |
0 |
8 |
|i Enthalten in
|t Journal of applied crystallography
|d 1998
|g 49(2016), Pt 3 vom: 01. Juni, Seite 756-761
|w (DE-627)NLM098121561
|x 0021-8898
|7 nnns
|
773 |
1 |
8 |
|g volume:49
|g year:2016
|g number:Pt 3
|g day:01
|g month:06
|g pages:756-761
|
912 |
|
|
|a GBV_USEFLAG_A
|
912 |
|
|
|a SYSFLAG_A
|
912 |
|
|
|a GBV_NLM
|
912 |
|
|
|a GBV_ILN_350
|
951 |
|
|
|a AR
|
952 |
|
|
|d 49
|j 2016
|e Pt 3
|b 01
|c 06
|h 756-761
|