default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert Schmidt 0002
Person information
- affiliation: University of Hamburg, ZBH - Center for Bioinformatics, Germany
Other persons with the same name
- Robert Schmidt — disambiguation page
- Robert Schmidt 0001
![[0000-0001-7428-2408]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-7428-2408")
— Eurecom, Communication Systems Department, Sophia Antipolis, France (and 2 more) - Robert Schmidt 0003 — University of Bremen, Institute of Electrodynamics and Microelectronics, Germany (and 1 more)
- Robert Schmidt 0004 — University of Sheffield, South Yorkshire, UK
- Robert Schmidt 0005 — TU Berlin, Quality and Usability Lab, Telekom Innovation Laboratories, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Sophia M. N. Hönig, Florian Flachsenberg, Christiane Ehrt, Alexander Neumann, Robert Schmidt, Christian Lemmen, Matthias Rarey:
SpaceGrow: efficient shape-based virtual screening of billion-sized combinatorial fragment spaces. J. Comput. Aided Mol. Des. 38(1): 13 (2024)- 2022
- [j6]Patrick Penner, Wolfgang Guba, Robert Schmidt, Agnes Meyder, Martin Stahl, Matthias Rarey:
The Torsion Library: Semiautomated Improvement of Torsion Rules with SMARTScompare. J. Chem. Inf. Model. 62(7): 1644-1653 (2022) - [j5]Robert Schmidt, Raphael Klein, Matthias Rarey:
Maximum Common Substructure Searching in Combinatorial Make-on-Demand Compound Spaces. J. Chem. Inf. Model. 62(9): 2133-2150 (2022) - 2021
- [b1]Robert Julius Schmidt:
Neue Algorithmen zur Bestimmung maximaler gemeinsamer Subgraphen in chemischen Mustern und Räumen (Novel Algorithms for the Calculation of Maximum Common Subgraphs in Chemical Patterns and Chemical Spaces). University of Hamburg, Germany, 2021 - [j4]Robert Schmidt, Florian Krull, Anna Lina Heinzke, Matthias Rarey:
Disconnected Maximum Common Substructures under Constraints. J. Chem. Inf. Model. 61(1): 167-178 (2021)
2010 – 2019
- 2019
- [j3]Robert Schmidt, Emanuel S. R. Ehmki, Farina Ohm, Hans-Christian Ehrlich, Andriy Mashychev, Matthias Rarey:
Comparing Molecular Patterns Using the Example of SMARTS: Theory and Algorithms. J. Chem. Inf. Model. 59(6): 2560-2571 (2019) - [j2]Emanuel S. R. Ehmki, Robert Schmidt, Farina Ohm, Matthias Rarey:
Comparing Molecular Patterns Using the Example of SMARTS: Applications and Filter Collection Analysis. J. Chem. Inf. Model. 59(6): 2572-2586 (2019) - 2017
- [j1]Therese Inhester, Stefan Bietz, Matthias Hilbig, Robert Schmidt, Matthias Rarey:
Index-Based Searching of Interaction Patterns in Large Collections of Protein-Ligand Interfaces. J. Chem. Inf. Model. 57(2): 148-158 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-07 02:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
