Cargando…
Accelerating Substructure Similarity Search for Formula Retrieval
Formula retrieval systems using substructure matching are effective, but suffer from slow retrieval times caused by the complexity of structure matching. We present a specialized inverted index and rank-safe dynamic pruning algorithm for faster substructure retrieval. Formulas are indexed from their...
Autores principales: | Zhong, Wei, Rohatgi, Shaurya, Wu, Jian, Giles, C. Lee, Zanibbi, Richard |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7148252/ http://dx.doi.org/10.1007/978-3-030-45439-5_47 |
Ejemplares similares
-
Retrieving similar substructures on 3D neuron reconstructions
por: Yang, Jian, et al.
Publicado: (2020) -
MathSeer: A Math-Aware Search Interface with Intuitive Formula Editing, Reuse, and Lookup
por: Nishizawa, Gavin, et al.
Publicado: (2020) -
A Structural Hierarchy Matching Approach for Molecular Similarity/Substructure Searching
por: Ji, Shu-Shen, et al.
Publicado: (2015) -
Large Scale Subject Category Classification of Scholarly Papers With Deep Attentive Neural Networks
por: Kandimalla, Bharath, et al.
Publicado: (2021) -
Substructure determination using phase-retrieval techniques
por: Skubák, Pavol
Publicado: (2018)