default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDávid Bajusz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Sonja Peter
, Lydia Siragusa, Morgan Thomas, Tommaso Palomba, Simon Cross, Noel M. O'boyle, Dávid Bajusz, György G. Ferenczy, György M. Keserü, Giovanni Bottegoni, Brian Joseph Bender, I-Jen Chen, Chris de Graaf:
Comparative Study of Allosteric GPCR Binding Sites and Their Ligandability Potential. J. Chem. Inf. Model. 64(21): 8176-8192 (2024)- 2023
- [j10]Dávid Bajusz, Gáspár Pándy-Szekeres, Ágnes Takács, Elvin D. de araujo, György M. Keserü:
SH2db, an information system for the SH2 domain. Nucleic Acids Res. 51(W1): 542-552 (2023) - 2022
- [j9]Anita Rácz, Timothy B. Dunn, Dávid Bajusz, Taewon David Kim, Ramón Alain Miranda-Quintana, Károly Héberger:
Extended continuous similarity indices: theory and application for QSAR descriptor selection. J. Comput. Aided Mol. Des. 36(3): 157-173 (2022) - [j8]Anita Rácz, Levente M. Mihalovits, Dávid Bajusz, Károly Héberger, Ramón Alain Miranda-Quintana:
Molecular Dynamics Simulations and Diversity Selection by Extended Continuous Similarity Indices. J. Chem. Inf. Model. 62(14): 3415-3425 (2022) - [j7]Amanda E. Wakefield, Dávid Bajusz, Dima Kozakov, György M. Keserü, Sandor Vajda:
Conservation of Allosteric Ligand Binding Sites in G-Protein Coupled Receptors. J. Chem. Inf. Model. 62(20): 4937-4954 (2022) - 2021
- [j6]Ramón Alain Miranda-Quintana, Dávid Bajusz, Anita Rácz, Károly Héberger:
Extended similarity indices: the benefits of comparing more than two objects simultaneously. Part 1: Theory and characteristics†. J. Cheminformatics 13(1): 32 (2021) - [j5]Ramón Alain Miranda-Quintana, Anita Rácz, Dávid Bajusz, Károly Héberger:
Extended similarity indices: the benefits of comparing more than two objects simultaneously. Part 2: speed, consistency, diversity selection. J. Cheminformatics 13(1): 33 (2021)
2010 – 2019
- 2018
- [j4]Zoltán Orgován, György G. Ferenczy, Thomas Steinbrecher, Bence Szilágyi, Dávid Bajusz, György M. Keserü:
Validation of tautomeric and protomeric binding modes by free energy calculations. A case study for the structure based optimization of d-amino acid oxidase inhibitors. J. Comput. Aided Mol. Des. 32(2): 331-345 (2018) - [j3]Anita Rácz, Dávid Bajusz, Károly Héberger:
Life beyond the Tanimoto coefficient: similarity measures for interaction fingerprints. J. Cheminformatics 10(1): 48:1-48:12 (2018) - 2016
- [j2]Dávid Bajusz, György G. Ferenczy, György M. Keserü:
Discovery of Subtype Selective Janus Kinase (JAK) Inhibitors by Structure-Based Virtual Screening. J. Chem. Inf. Model. 56(1): 234-247 (2016) - 2015
- [j1]Dávid Bajusz, Anita Rácz, Károly Héberger:
Why is Tanimoto index an appropriate choice for fingerprint-based similarity calculations? J. Cheminformatics 7: 20:1-20:13 (2015)
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-12-23 20:27 CET 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:
