On Sunday, April 20th 2025, starting 8:30am GMT, there will be maintenance work that will involve the website being unavailable during parts of the day. We apologize for any inconvenience this may cause and appreciate your understanding.
We noted you are experiencing viewing problems
-
Check with your IT department that JWPlatform, JWPlayer and Amazon AWS & CloudFront are not being blocked by your network. The relevant domains are *.jwplatform.com, *.jwpsrv.com, *.jwpcdn.com, jwpltx.com, jwpsrv.a.ssl.fastly.net, *.amazonaws.com and *.cloudfront.net. The relevant ports are 80 and 443.
-
Check the following talk links to see which ones work correctly:
Auto Mode
HTTP Progressive Download Send us your results from the above test links at access@hstalks.com and we will contact you with further advice on troubleshooting your viewing problems. -
No luck yet? More tips for troubleshooting viewing issues
-
Contact HST Support access@hstalks.com
-
Please review our troubleshooting guide for tips and advice on resolving your viewing problems.
-
For additional help, please don't hesitate to contact HST support access@hstalks.com
We hope you have enjoyed this limited-length demo
This is a limited length demo talk; you may
login or
review methods of
obtaining more access.
Printable Handouts
Navigable Slide Index
- Introduction
- The challenge
- Sequential data search
- The holy grail of searching
- Bisection with sorted data
- Data structure binary tree (1)
- Data structure binary tree (2)
- Data structure binary tree (3)
- Data structure binary tree (4)
- Data structure binary tree (5)
- The worst case
- Speed vs. Optimum structure
- Data structure hash table
- Data structure hash table: search time
- Problems of hash methods
- Matching of data (1)
- Matching of data (2)
- Matching of data (3)
- Index creation (1)
- Index creation (2)
- Chemical exact structure search
- Chemical substructure search
- Brute-force explanation
- The formula
- ABAS in practice
- Heuristic backtracking in molecular tree
- Molecular tree: example
- The concept of screening
- Screen-based bit sequence
- Avoid/Minimize ABAS
- Index of screens
- The goal of fast screening
- Problems of the screen technique
- Further improvements
- Overlap of screens
- Tanimoto coefficient
- Chemical reaction retrieval
- Atom-to-atom mapping
- Breaking/Formation of bonds
- Super atoms, generic groups, R groups
- Chemical reaction retrieval: two philosophies
- Generation of synthesis trees for synthesis
- Chemical reaction retrieval: example
- Chemical reaction retrieval: stages combination
- Document and fact retrieval
- Document and fact retrieval: Industrial practice
- Exact & Partial match searches
- Similarity & Associative searches
Topics Covered
- Sequential data search
- Bisection with sorted data
- Data structure binary tree & hash table
- Speed vs. Optimum structure
- Problems of hash methods
- Matching of data
- Index creation
- Chemical exact structure and substructure search
- Brute-force explanation
- ABAS in practice
- Heuristic backtracking in molecular tree
- The concept of screening
- Tanimoto coefficient
- Chemical reaction retrieval
- Atom-to-atom mapping
- Breaking/Formation of bonds
- Super atoms, generic groups, R groups
- Generation of synthesis trees for synthesis
- Document and fact retrieval
- Exact & Partial match searches
- Similarity & Associative searches
Talk Citation
Zielesny, A. (2022, April 12). Storing, searching and dissemination of chemical information [Video file]. In The Biomedical & Life Sciences Collection, Henry Stewart Talks. Retrieved April 15, 2025, from https://doi.org/10.69645/TOZA8410.Export Citation (RIS)
Publication History
Financial Disclosures
- Prof. Achim Zielesny has not informed HSTalks of any commercial/financial relationship that it is appropriate to disclose.