Hit-directed nearest neighbor searching.

被引:0
|
作者
Shanmugasundaram, V
Maggiora, GM
机构
[1] Pfizer Global Res & Dev, Comp Assisted Drug Discovery, Ann Arbor, MI 48105 USA
[2] Univ Arizona, Dept Pharmacol & Toxicol, Tucson, AZ 85721 USA
关键词
D O I
暂无
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
065-CINF
引用
收藏
页码:U688 / U688
页数:1
相关论文
共 50 条
  • [1] Hit-directed nearest neighbor searching.
    Shanmugasundaram, V
    Maggiora, GM
    ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2003, 226 : U307 - U307
  • [2] Hit-directed nearest-neighbor searching
    Shanmugasundaram, V
    Maggiora, GM
    Lajiness, MS
    JOURNAL OF MEDICINAL CHEMISTRY, 2005, 48 (01) : 240 - 248
  • [3] Searching Nearest Neighbor In Overlay Network
    Chen, Tan
    Xiong, Xin
    2008 IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS, VOLS 1-3, 2008, : 88 - +
  • [4] High dimensional nearest neighbor searching
    Ferhatosmanoglu, Hakan
    Tuncel, Ertem
    Agrawal, Divyakant
    El Abbadi, Amr
    INFORMATION SYSTEMS, 2006, 31 (06) : 512 - 540
  • [5] The Closest BLAST Hit Is Often Not the Nearest Neighbor
    Liisa B. Koski
    G. Brian Golding
    Journal of Molecular Evolution, 2001, 52 : 540 - 542
  • [6] The closest BLAST hit is often not the nearest neighbor
    Koski, LB
    Golding, GB
    JOURNAL OF MOLECULAR EVOLUTION, 2001, 52 (06) : 540 - 542
  • [7] Approximate nearest neighbor searching in multimedia databases
    Ferhatosmanoglu, H
    Tuncel, E
    Agrawal, D
    El Abbadi, A
    17TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS, 2001, : 503 - 511
  • [8] Near neighbor searching with K nearest references
    Chavez, E.
    Graff, M.
    Navarro, G.
    Tellez, E. S.
    INFORMATION SYSTEMS, 2015, 51 : 43 - 61
  • [9] Searching Continuous Nearest Neighbor in transport Network
    Guo Junfeng
    Cao Yu
    Zuo Lei
    2018 INTERNATIONAL CONFERENCE ON ROBOTS & INTELLIGENT SYSTEM (ICRIS 2018), 2018, : 501 - 505
  • [10] The analysis of a probabilistic approach to nearest neighbor searching
    Maneewongvatana, S
    Mount, DM
    ALGORITHMS AND DATA STRUCTURES, 2001, 2125 : 276 - 286