default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThorsten Meinl
Person information
- affiliation: University of Konstanz, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j8]Thorsten Meinl, Bernd Wiswedel, Michael R. Berthold:
Looking over the rim: algorithms for cheminformatics from computer scientists. J. Cheminformatics 6(S-1): 13 (2014)- 2013
- [j7]Stephan Beisken
, Thorsten Meinl, Bernd Wiswedel, Luis F. de Figueiredo, Michael R. Berthold, Christoph Steinbeck:
KNIME-CDK: Workflow-driven Cheminformatics. BMC Bioinform. 14: 257 (2013) - [j6]Thorsten Meinl, Gregory A. Landrum:
Get your chemistry right with KNIME. J. Cheminformatics 5(S-1): 1 (2013) - 2012
- [j5]Thorsten Meinl:
What's new in KNIME? J. Cheminformatics 4(S-1): 2 (2012) - 2011
- [j4]Thorsten Meinl, Claude Ostermann, Michael R. Berthold:
Maximum-Score Diversity Selection for Early Drug Discovery. J. Chem. Inf. Model. 51(2): 237-247 (2011) - 2010
- [b1]Thorsten Meinl:
Maximum-score diversity selection. University of Konstanz, 2010 - [j3]Thorsten Meinl, Claude Ostermann, Olaf Nimz, Andrea Zaliani, Michael R. Berthold:
Maximum-score diversity selection for early drug discovery. J. Cheminformatics 2(S-1): 33 (2010)
2000 – 2009
- 2009
- [j2]Michael R. Berthold, Nicolas Cebron, Fabian Dill, Thomas R. Gabriel, Tobias Kötter, Thorsten Meinl, Peter Ohl, Kilian Thiel, Bernd Wiswedel:
KNIME - the Konstanz information miner: version 2.0 and beyond. SIGKDD Explor. 11(1): 26-31 (2009) - [c10]Thorsten Meinl, Michael R. Berthold:
Crossover operators for multiobjective k-subset selection. GECCO 2009: 1809-1810 - [p1]Christian Borgelt, Thorsten Meinl:
Full Perfect Extension Pruning for Frequent Subgraph Mining. Mining Complex Data 2009: 189-205 - 2007
- [c9]Alexander Dreweke, Marc Wörlein, Ingrid Fischer, Dominic Schell, Thorsten Meinl, Michael Philippsen:
Graph-Based Procedural Abstraction. CGO 2007: 259-270 - [c8]Michael R. Berthold, Nicolas Cebron, Fabian Dill, Thomas R. Gabriel, Tobias Kötter, Thorsten Meinl, Peter Ohl, Christoph Sieb, Kilian Thiel, Bernd Wiswedel:
KNIME: The Konstanz Information Miner. GfKl 2007: 319-326 - 2006
- [j1]Thorsten Meinl, Marc Wörlein, Olga Urzova, Ingrid Fischer, Michael Philippsen:
The ParMol Package for Frequent Subgraph Mining. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 1 (2006) - [c7]Christian Borgelt, Thorsten Meinl:
Full Perfect Extension Pruning for Frequent Graph Mining. ICDM Workshops 2006: 263-268 - [c6]Thorsten Meinl, Marc Wörlein, Ingrid Fischer, Michael Philippsen:
Mining Molecular Datasets on Symmetric Multiprocessor Systems. SMC 2006: 1269-1274 - 2005
- [c5]Thorsten Meinl, Ingrid Fischer, Michael Philippsen:
Parallel Mining for Frequent Fragments on a Shared-Memory Multiprocessor - Results and Java-Obstacles. LWA 2005: 196-201 - [c4]Marc Wörlein, Thorsten Meinl, Ingrid Fischer, Michael Philippsen:
A Quantitative Comparison of the Subgraph Miners MoFa, gSpan, FFSM, and Gaston. PKDD 2005: 392-403 - 2004
- [c3]Thorsten Meinl, Michael R. Berthold:
Hybrid fragment mining with MoFa and FSG. SMC (5) 2004: 4559-4564 - [c2]Christian Borgelt, Thorsten Meinl, Michael R. Berthold:
Advanced pruning strategies to speed up mining closed molecular fragments. SMC (5) 2004: 4565-4570 - [c1]Ingrid Fischer, Thorsten Meinl:
Graph based molecular data mining - an overview. SMC (5) 2004: 4578-4582
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-10-07 21:18 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:
