Bounds and Algorithms for Fast Exact Searches of Chemical Fingerprints in Linear and Sublinear Time-Reference-Cited by-同舟云学术

Bounds and Algorithms for Fast Exact Searches of Chemical Fingerprints in Linear and Sublinear Time

Published:2007-02-28 Issue:2 Volume:47 Page:302-317
ISSN:1549-9596
Container-title:Journal of Chemical Information and Modeling
language:en
Short-container-title:J. Chem. Inf. Model.

Author:

Swamidass S. Joshua¹,Baldi Pierre¹

Affiliation:

1. Institute for Genomics and Bioinformatics, School of Information and Computer Sciences, University of California, Irvine, Irvine, California 92697-3435

Publisher

American Chemical Society (ACS)

Subject

Library and Information Sciences,Computer Science Applications,General Chemical Engineering,General Chemistry

Link

https://pubs.acs.org/doi/pdf/10.1021/ci600358f

Reference18 articles.

1. A Modification of the Jaccard–Tanimoto Similarity Index for Diverse Selection of Chemical Compounds Using Binary Strings

2. On the Properties of Bit String-Based Measures of Chemical Similarity

Cited by 77 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Open-Source Approach to GPU-Accelerated Substructure Search;Journal of Chemical Information and Modeling;2024-09-03

2. Utilizing Low-Dimensional Molecular Embeddings for Rapid Chemical Similarity Search;Lecture Notes in Computer Science;2024

3. APDB: a database on air pollutant characterization and similarity prediction;Database;2023-01-01

4. Optimizing FPGA-based Accelerator Design for Large-Scale Molecular Similarity Search (Special Session Paper);2021 IEEE/ACM International Conference On Computer Aided Design (ICCAD);2021-11-01

5. Benchmark on Indexing Algorithms for Accelerating Molecular Similarity Search;Journal of Chemical Information and Modeling;2020-10-23