Bioaffinity chromatography in the 10 mM range of K-d

被引：19
|
作者：
Leickt, L
Bergstrom, M
Zopf, D
Ohlson, S
机构：
[1] UNIV KALMAR,DEPT NAT SCI,S-39129 KALMAR,SWEDEN
[2] NEOSE TECHNOL INC,HORSHAM,PA 19044
来源：
ANALYTICAL BIOCHEMISTRY | 1997年 / 253卷 / 01期
关键词：
D O I：
10.1006/abio.1997.2385
中图分类号：
Q5 [生物化学];
学科分类号：
071010 ; 081704 ;
摘要：
[No abstract available]
引用
收藏
页码：135 / 136
页数：2
相关论文
共 50 条
  • [1] K-D -! K-D AND K-D -!K-NP REACTIONS AT 727 MEV/C
    WIECKOWI.RP
    ALBRIGHT, JR
    LANNUTTI, JE
    BULLETIN OF THE AMERICAN PHYSICAL SOCIETY, 1970, 15 (04): : 583 - &
  • [2] Analysis of range search for random k-d trees
    Chanzy, P
    Devroye, L
    Zamora-Cura, C
    ACTA INFORMATICA, 2001, 37 (4-5) : 355 - 383
  • [3] Analysis of range search for random k-d trees
    Philippe Chanzy
    Luc Devroye
    Carlos Zamora-Cura
    Acta Informatica, 2001, 37 : 355 - 383
  • [4] An externalization of the k-d tree
    Adam, M.
    ROMANIAN JOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY, 2007, 10 (04): : 323 - 333
  • [5] DIVIDED K-D TREES
    VANKREVELD, MJ
    OVERMARS, MH
    ALGORITHMICA, 1991, 6 (06) : 840 - 858
  • [6] Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back
    Chan, Timothy M.
    DISCRETE & COMPUTATIONAL GEOMETRY, 2019, 61 (04) : 899 - 922
  • [7] Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back
    Timothy M. Chan
    Discrete & Computational Geometry, 2019, 61 : 899 - 922
  • [8] Squarish k-d trees
    Devroye, L
    Jabbour, J
    Zamora-Cura, C
    SIAM JOURNAL ON COMPUTING, 2000, 30 (05) : 1678 - 1700
  • [9] LONG-RANGE K-D CORRELATION AMONG DROPLETS IN QUENCHED SYSTEMS IN D DIMENSIONS
    FURUKAWA, H
    PHYSICAL REVIEW B, 1986, 33 (01): : 638 - 640
  • [10] K-D Bonsai: ISA-Extensions to Compress K-D Trees for Autonomous Driving Tasks
    Becker, Pedro H. E.
    Arnau, Jose-Maria
    Gonzalez, Antonio
    PROCEEDINGS OF THE 2023 THE 50TH ANNUAL INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE, ISCA 2023, 2023, : 275 - 287
12345