<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet href="/rss.css" type="text/css"?>
<rdf:RDF xmlns="http://purl.org/rss/1.0/"
    xmlns:cc="http://web.resource.org/cc/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:extra="http://www.w3.org/1999/xhtml"
    xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#">
    <channel rdf:about="http://jcheminf.com/feeds/mostaccessed/journal?quantity=&amp;format=rss&amp;version=">
        <title>Journal of Cheminformatics - Most accessed articles</title>
        <link>http://www.jcheminf.com</link>
        <description>The most accessed research articles published by Journal of Cheminformatics</description>
        <dc:date>2010-03-11T00:00:00Z</dc:date>
        <items>
            <rdf:Seq>
                                <rdf:li rdf:resource="http://www.jcheminf.com/content/2/1/1" />
                                <rdf:li rdf:resource="http://www.jcheminf.com/content/1/1/22" />
                                <rdf:li rdf:resource="http://www.jcheminf.com/content/1/1/21" />
                                <rdf:li rdf:resource="http://www.jcheminf.com/content/1/1/3" />
                                <rdf:li rdf:resource="http://www.jcheminf.com/content/1/1/8" />
                                <rdf:li rdf:resource="http://www.jcheminf.com/content/1/1/14" />
                                <rdf:li rdf:resource="http://www.jcheminf.com/content/1/1/10" />
                                <rdf:li rdf:resource="http://www.jcheminf.com/content/1/1/20" />
                                <rdf:li rdf:resource="http://www.jcheminf.com/content/2/1/2" />
                                <rdf:li rdf:resource="http://www.jcheminf.com/content/1/1/15" />
                            </rdf:Seq>
        </items>
        <extra:info rdf:parseType="Literal">
            <html:div style="font:14px Verdana, Geneva, Arial, Helvetica, sans-serif" xmlns:html="http://www.w3.org/1999/xhtml">
                <html:span style="font-weight:bold">
                    This is an RSS newsfeed from BioMed Central
                </html:span>
                <html:br />
                <html:span style="font-size: 12px;">
                    It is intended to be used with an RSS reader. For more information about RSS newsfeeds from BioMed Central, visit
                    <html:br />
                    <html:a href="http://www.biomedcentral.com/info/about/rss/" style="color:#3333CC; font-size:12px;">
                        http://www.biomedcentral.com/info/about/rss/
                    </html:a>
                    <html:br />
                </html:span>
            </html:div>
        </extra:info>
        <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
    </channel>
        <item rdf:about="http://www.jcheminf.com/content/2/1/1">
        <title>Molecular structure input on the web</title>
        <description>A molecule editor, that is program for input and editing of molecules, is an indispensable part of every cheminformatics or molecular processing system. This review focuses on a special type of molecule editors, namely those that are used for molecule structure input on the web. Scientific computing is now moving more and more in the direction of web services and cloud computing, with servers scattered all around the Internet. Thus a web browser has become the universal scientific user interface, and a tool to edit molecules directly within the web browser is essential.The review covers a history of web-based structure input, starting with simple text entry boxes and early molecule editors based on clickable maps, before moving to the current situation dominated by Java applets. One typical example - the popular JME Molecule Editor - will be described in more detail. Modern Ajax server-side molecule editors are also presented. And finally, the possible future direction of web-based molecule editing, based on technologies like JavaScript and Flash, is discussed.</description>
        <link>http://www.jcheminf.com/content/2/1/1</link>
                <dc:creator>Peter Ertl</dc:creator>
                <dc:source>Journal of Cheminformatics 2010, 2:1</dc:source>
        <dc:date>2010-02-02T00:00:00Z</dc:date>
        <dc:identifier>doi:10.1186/1758-2946-2-1</dc:identifier>
        <prism:publicationName>Journal of Cheminformatics</prism:publicationName>
        <prism:issn>1758-2946</prism:issn>
        <prism:volume>2</prism:volume>
        <prism:startingPage>1</prism:startingPage>
        <prism:publicationDate>2010-02-02T00:00:00Z</prism:publicationDate>
                <prism:versionidentifier>XML</prism:versionidentifier>
                <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
    </item>
        <item rdf:about="http://www.jcheminf.com/content/1/1/22">
        <title>Interpretable correlation descriptors for quantitative structure-activity relationships</title>
        <description>Background:
The topological maximum cross correlation (TMACC) descriptors are alignment-independent 2D descriptors for the derivation of QSARs. TMACC descriptors are generated using atomic properties determined by molecular topology. Previous validation (J Chem Inf Model 2007, 47: 626-634) of the TMACC descriptor suggests it is competitive with the current state of the art.
Results:
Here, we illustrate the interpretability of the TMACC descriptors, through the analysis of the QSARs of inhibitors of angiotensin converting enzyme (ACE) and dihydrofolate reductase (DHFR). In the case of the ACE inhibitors, the TMACC interpretation shows features specific to C-domain inhibition, which have not been explicitly identified in previous QSAR studies.
Conclusions:
The TMACC interpretation can provide new insight into the structure-activity relationships studied. Freely available, open source software for generating the TMACC descriptors can be downloaded from http://comp.chem.nottingham.ac.uk.</description>
        <link>http://www.jcheminf.com/content/1/1/22</link>
                <dc:creator>Benson Spowage</dc:creator>
                <dc:creator>Craig Bruce</dc:creator>
                <dc:creator>Jonathan Hirst</dc:creator>
                <dc:source>Journal of Cheminformatics 2009, 1:22</dc:source>
        <dc:date>2009-12-24T00:00:00Z</dc:date>
        <dc:identifier>doi:10.1186/1758-2946-1-22</dc:identifier>
        <prism:publicationName>Journal of Cheminformatics</prism:publicationName>
        <prism:issn>1758-2946</prism:issn>
        <prism:volume>1</prism:volume>
        <prism:startingPage>22</prism:startingPage>
        <prism:publicationDate>2009-12-24T00:00:00Z</prism:publicationDate>
                <prism:versionidentifier>XML</prism:versionidentifier>
                <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
    </item>
        <item rdf:about="http://www.jcheminf.com/content/1/1/21">
        <title>Virtual screening of bioassay data</title>
        <description>Background:
There are three main problems associated with the virtual screening of bioassay data. The first is access to freely-available curated data, the second is the number of false positives that occur in the physical primary screening process, and finally the data is highly-imbalanced with a low ratio of Active compounds to Inactive compounds. This paper first discusses these three problems and then a selection of Weka cost-sensitive classifiers (Naive Bayes, SVM, C4.5 and Random Forest) are applied to a variety of bioassay datasets.
Results:
Pharmaceutical bioassay data is not readily available to the academic community. The data held at PubChem is not curated and there is a lack of detailed cross-referencing between Primary and Confirmatory screening assays. With regard to the number of false positives that occur in the primary screening process, the analysis carried out has been shallow due to the lack of cross-referencing mentioned above. In six cases found, the average percentage of false positives from the High-Throughput Primary screen is quite high at 64%. For the cost-sensitive classification, Weka&apos;s implementations of the Support Vector Machine and C4.5 decision tree learner have performed relatively well. It was also found, that the setting of the Weka cost matrix is dependent on the base classifier used and not solely on the ratio of class imbalance.
Conclusions:
Understandably, pharmaceutical data is hard to obtain. However, it would be beneficial to both the pharmaceutical industry and to academics for curated primary screening and corresponding confirmatory data to be provided. Two benefits could be gained by employing virtual screening techniques to bioassay data. First, by reducing the search space of compounds to be screened and secondly, by analysing the false positives that occur in the primary screening process, the technology may be improved. The number of false positives arising from primary screening leads to the issue of whether this type of data should be used for virtual screening. Care when using Weka&apos;s cost-sensitive classifiers is needed - across the board misclassification costs based on class ratios should not be used when comparing differing classifiers for the same dataset.</description>
        <link>http://www.jcheminf.com/content/1/1/21</link>
                <dc:creator>Amanda Schierz</dc:creator>
                <dc:source>Journal of Cheminformatics 2009, 1:21</dc:source>
        <dc:date>2009-12-22T00:00:00Z</dc:date>
        <dc:identifier>doi:10.1186/1758-2946-1-21</dc:identifier>
        <prism:publicationName>Journal of Cheminformatics</prism:publicationName>
        <prism:issn>1758-2946</prism:issn>
        <prism:volume>1</prism:volume>
        <prism:startingPage>21</prism:startingPage>
        <prism:publicationDate>2009-12-22T00:00:00Z</prism:publicationDate>
                <prism:versionidentifier>XML</prism:versionidentifier>
                <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
    </item>
        <item rdf:about="http://www.jcheminf.com/content/1/1/3">
        <title>Computer-assisted methods for molecular structure elucidation: realizing a spectroscopist&apos;s dream</title>
        <description>Background:
This article coincides with the 40 year anniversary of the first published works devoted to the creation of algorithms for computer-aided structure elucidation (CASE). The general principles on which CASE methods are based will be reviewed and the present state of the art in this field will be described using, as an example, the expert system Structure Elucidator.
Results:
The developers of CASE systems have been forced to overcome many obstacles hindering the development of a software application capable of drastically reducing the time and effort required to determine the structures of newly isolated organic compounds. Large complex molecules of up to 100 or more skeletal atoms with topological peculiarity can be quickly identified using the expert system Structure Elucidator based on spectral data. Logical analysis of 2D NMR data frequently allows for the detection of the presence of COSY and HMBC correlations of &quot;nonstandard&quot; length. Fuzzy structure generation provides a possibility to obtain the correct solution even in those cases when an unknown number of nonstandard correlations of unknown length are present in the spectra. The relative stereochemistry of big rigid molecules containing many stereocenters can be determined using the StrucEluc system and NOESY/ROESY 2D NMR data for this purpose.
Conclusion:
The StrucEluc system continues to be developed in order to expand the general applicability, provide improved workflows, usability of the system and increased reliability of the results. It is expected that expert systems similar to that described in this paper will receive increasing acceptance in the next decade and will ultimately be integrated directly to analytical instruments for the purpose of organic analysis. Work in this direction is in progress. In spite of the fact that many difficulties have already been overcome to deliver on the spectroscopist&apos;s dream of &quot;fully automated structure elucidation&quot; there is still work to do. Nevertheless, as the efficiency of expert systems is enhanced the solution of increasingly complex structural problems will be achievable.</description>
        <link>http://www.jcheminf.com/content/1/1/3</link>
                <dc:creator>Mikhail Elyashberg</dc:creator>
                <dc:creator>Kirill Blinov</dc:creator>
                <dc:creator>Sergey Molodtsov</dc:creator>
                <dc:creator>Yegor Smurnyy</dc:creator>
                <dc:creator>Antony Williams</dc:creator>
                <dc:creator>Tatiana Churanova</dc:creator>
                <dc:source>Journal of Cheminformatics 2009, 1:3</dc:source>
        <dc:date>2009-03-17T00:00:00Z</dc:date>
        <dc:identifier>doi:10.1186/1758-2946-1-3</dc:identifier>
        <prism:publicationName>Journal of Cheminformatics</prism:publicationName>
        <prism:issn>1758-2946</prism:issn>
        <prism:volume>1</prism:volume>
        <prism:startingPage>3</prism:startingPage>
        <prism:publicationDate>2009-03-17T00:00:00Z</prism:publicationDate>
                <prism:versionidentifier>XML</prism:versionidentifier>
                <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
    </item>
        <item rdf:about="http://www.jcheminf.com/content/1/1/8">
        <title>Estimation of synthetic accessibility score of drug-like molecules based on molecular complexity and fragment contributions</title>
        <description>Background:
A method to estimate ease of synthesis (synthetic accessibility) of drug-like molecules is needed in many areas of the drug discovery process. The development and validation of such a method that is able to characterize molecule synthetic accessibility as a score between 1 (easy to make) and 10 (very difficult to make) is described in this article.
Results:
The method for estimation of the synthetic accessibility score (SAscore) described here is based on a combination of fragment contributions and a complexity penalty. Fragment contributions have been calculated based on the analysis of one million representative molecules from PubChem and therefore one can say that they capture historical synthetic knowledge stored in this database. The molecular complexity score takes into account the presence of non-standard structural features, such as large rings, non-standard ring fusions, stereocomplexity and molecule size. The method has been validated by comparing calculated SAscores with ease of synthesis as estimated by experienced medicinal chemists for a set of 40 molecules. The agreement between calculated and manually estimated synthetic accessibility is very good with r2 = 0.89.
Conclusion:
A novel method to estimate synthetic accessibility of molecules has been developed. This method uses historical synthetic knowledge obtained by analyzing information from millions of already synthesized chemicals and considers also molecule complexity. The method is sufficiently fast and provides results consistent with estimation of ease of synthesis by experienced medicinal chemists. The calculated SAscore may be used to support various drug discovery processes where a large number of molecules needs to be ranked based on their synthetic accessibility, for example when purchasing samples for screening, selecting hits from high-throughput screening for follow-up, or ranking molecules generated by various de novo design approaches.</description>
        <link>http://www.jcheminf.com/content/1/1/8</link>
                <dc:creator>Peter Ertl</dc:creator>
                <dc:creator>Ansgar Schuffenhauer</dc:creator>
                <dc:source>Journal of Cheminformatics 2009, 1:8</dc:source>
        <dc:date>2009-06-10T00:00:00Z</dc:date>
        <dc:identifier>doi:10.1186/1758-2946-1-8</dc:identifier>
        <prism:publicationName>Journal of Cheminformatics</prism:publicationName>
        <prism:issn>1758-2946</prism:issn>
        <prism:volume>1</prism:volume>
        <prism:startingPage>8</prism:startingPage>
        <prism:publicationDate>2009-06-10T00:00:00Z</prism:publicationDate>
                <prism:versionidentifier>XML</prism:versionidentifier>
                <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
    </item>
        <item rdf:about="http://www.jcheminf.com/content/1/1/14">
        <title>Optimal assignment methods for ligand-based virtual screening</title>
        <description>Background:
Ligand-based virtual screening experiments are an important task in the early drug discovery stage. An ambitious aim in each experiment is to disclose active structures based on new scaffolds. To perform these &quot;scaffold-hoppings&quot; for individual problems and targets, a plethora of different similarity methods based on diverse techniques were published in the last years. The optimal assignment approach on molecular graphs, a successful method in the field of quantitative structure-activity relationships, has not been tested as a ligand-based virtual screening method so far.
Results:
We evaluated two already published and two new optimal assignment methods on various data sets. To emphasize the &quot;scaffold-hopping&quot; ability, we used the information of chemotype clustering analyses in our evaluation metrics. Comparisons with literature results show an improved early recognition performance and comparable results over the complete data set. A new method based on two different assignment steps shows an increased &quot;scaffold-hopping&quot; behavior together with a good early recognition performance.
Conclusion:
The presented methods show a good combination of chemotype discovery and enrichment of active structures. Additionally, the optimal assignment on molecular graphs has the advantage to investigate and interpret the mappings, allowing precise modifications of internal parameters of the similarity measure for specific targets. All methods have low computation times which make them applicable to screen large data sets.</description>
        <link>http://www.jcheminf.com/content/1/1/14</link>
                <dc:creator>Andreas Jahn</dc:creator>
                <dc:creator>Georg Hinselmann</dc:creator>
                <dc:creator>Nikolas Fechner</dc:creator>
                <dc:creator>Andreas Zell</dc:creator>
                <dc:source>Journal of Cheminformatics 2009, 1:14</dc:source>
        <dc:date>2009-08-25T00:00:00Z</dc:date>
        <dc:identifier>doi:10.1186/1758-2946-1-14</dc:identifier>
        <prism:publicationName>Journal of Cheminformatics</prism:publicationName>
        <prism:issn>1758-2946</prism:issn>
        <prism:volume>1</prism:volume>
        <prism:startingPage>14</prism:startingPage>
        <prism:publicationDate>2009-08-25T00:00:00Z</prism:publicationDate>
                <prism:versionidentifier>XML</prism:versionidentifier>
                <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
    </item>
        <item rdf:about="http://www.jcheminf.com/content/1/1/10">
        <title>Quantitative assessment of the expanding complementarity between public and commercial databases of bioactive compounds</title>
        <description>Background:
Since 2004 public cheminformatic databases and their collective functionality for exploring relationships between compounds, protein sequences, literature and assay data have advanced dramatically. In parallel, commercial sources that extract and curate such relationships from journals and patents have also been expanding. This work updates a previous comparative study of databases chosen because of their bioactive content, availability of downloads and facility to select informative subsets.
Results:
Where they could be calculated, extracted compounds-per-journal article were in the range of 12 to 19 but compound-per-protein counts increased with document numbers. Chemical structure filtration to facilitate standardised comparisons typically reduced source counts by between 5% and 30%. The pair-wise overlaps between 23 databases and subsets were determined, as well as changes between 2006 and 2008. While all compound sets have increased, PubChem has doubled to 14.2 million. The 2008 comparison matrix shows not only overlap but also unique content across all sources. Many of the detailed differences could be attributed to individual strategies for data selection and extraction. While there was a big increase in patent-derived structures entering PubChem since 2006, GVKBIO contains over 0.8 million unique structures from this source. Venn diagrams showed extensive overlap between compounds extracted by independent expert curation from journals by GVKBIO, WOMBAT (both commercial) and BindingDB (public) but each included unique content. In contrast, the approved drug collections from GVKBIO, MDDR (commercial) and DrugBank (public) showed surprisingly low overlap. Aggregating all commercial sources established that while 1 million compounds overlapped with PubChem 1.2 million did not.
Conclusion:
On the basis of chemical structure content per se public sources have covered an increasing proportion of commercial databases over the last two years. However, commercial products included in this study provide links between compounds and information from patents and journals at a larger scale than current public efforts. They also continue to capture a significant proportion of unique content. Our results thus demonstrate not only an encouraging overall expansion of data-supported bioactive chemical space but also that both commercial and public sources are complementary for its exploration.</description>
        <link>http://www.jcheminf.com/content/1/1/10</link>
                <dc:creator>Christopher Southan</dc:creator>
                <dc:creator>Peter Varkonyi</dc:creator>
                <dc:creator>Sorel Muresan</dc:creator>
                <dc:source>Journal of Cheminformatics 2009, 1:10</dc:source>
        <dc:date>2009-07-06T00:00:00Z</dc:date>
        <dc:identifier>doi:10.1186/1758-2946-1-10</dc:identifier>
        <prism:publicationName>Journal of Cheminformatics</prism:publicationName>
        <prism:issn>1758-2946</prism:issn>
        <prism:volume>1</prism:volume>
        <prism:startingPage>10</prism:startingPage>
        <prism:publicationDate>2009-07-06T00:00:00Z</prism:publicationDate>
                <prism:versionidentifier>XML</prism:versionidentifier>
                <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
    </item>
        <item rdf:about="http://www.jcheminf.com/content/1/1/20">
        <title>The PubChem chemical structure sketcher</title>
        <description>PubChem is an important public, Web-based information source for chemical and bioactivity information. In order to provide convenient structure search methods on compounds stored in this database, one mandatory component is a Web-based drawing tool for interactive sketching of chemical query structures. Web-enabled chemical structure sketchers are not new, being in existence for years; however, solutions available rely on complex technology like Java applets or platform-dependent plug-ins. Due to general policy and support incident rate considerations, Java-based or platform-specific sketchers cannot be deployed as a part of public NCBI Web services. Our solution: a chemical structure sketching tool based exclusively on CGI server processing, client-side JavaScript functions, and image sequence streaming. The PubChem structure editor does not require the presence of any specific runtime support libraries or browser configurations on the client. It is completely platform-independent and verified to work on all major Web browsers, including older ones without support for Web2.0 JavaScript objects.</description>
        <link>http://www.jcheminf.com/content/1/1/20</link>
                <dc:creator>Wolf-D. Ihlenfeldt</dc:creator>
                <dc:creator>Evan Bolton</dc:creator>
                <dc:creator>Stephen Bryant</dc:creator>
                <dc:source>Journal of Cheminformatics 2009, 1:20</dc:source>
        <dc:date>2009-12-17T00:00:00Z</dc:date>
        <dc:identifier>doi:10.1186/1758-2946-1-20</dc:identifier>
        <prism:publicationName>Journal of Cheminformatics</prism:publicationName>
        <prism:issn>1758-2946</prism:issn>
        <prism:volume>1</prism:volume>
        <prism:startingPage>20</prism:startingPage>
        <prism:publicationDate>2009-12-17T00:00:00Z</prism:publicationDate>
                <prism:versionidentifier>XML</prism:versionidentifier>
                <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
    </item>
        <item rdf:about="http://www.jcheminf.com/content/2/1/2">
        <title>Estimation of the applicability domain of kernel-based machine learning models for virtual screening</title>
        <description>Background:
The virtual screening of large compound databases is an important application of structural-activity relationship models. Due to the high structural diversity of these data sets, it is impossible for machine learning based QSAR models, which rely on a specific training set, to give reliable results for all compounds. Thus, it is important to consider the subset of the chemical space in which the model is applicable. The approaches to this problem that have been published so far mostly use vectorial descriptor representations to define this domain of applicability of the model. Unfortunately, these cannot be extended easily to structured kernel-based machine learning models. For this reason, we propose three approaches to estimate the domain of applicability of a kernel-based QSAR model.
Results:
We evaluated three kernel-based applicability domain estimations using three different structured kernels on three virtual screening tasks. Each experiment consisted of the training of a kernel-based QSAR model using support vector regression and the ranking of a disjoint screening data set according to the predicted activity. For each prediction, the applicability of the model for the respective compound is quantitatively described using a score obtained by an applicability domain formulation. The suitability of the applicability domain estimation is evaluated by comparing the model performance on the subsets of the screening data sets obtained by different thresholds for the applicability scores.  This comparison indicates that it is possible to separate the part of the chemspace, in which the model gives reliable predictions, from the part consisting of structures too dissimilar to the training set to apply the model successfully. A closer inspection reveals that the virtual screening performance of the model is considerably improved if half of the molecules, those with the lowest applicability scores, are omitted from the screening.
Conclusion:
The proposed applicability domain formulations for kernel-based QSAR models can successfully identify compounds for which no reliable predictions can be expected from the model. The resulting reduction of the search space and the elimination of some of the active compounds should not be considered as a drawback, because the results indicate that, in most cases, these omitted ligands would not be found by the model anyway.</description>
        <link>http://www.jcheminf.com/content/2/1/2</link>
                <dc:creator>Nikolas Fechner</dc:creator>
                <dc:creator>Andreas Jahn</dc:creator>
                <dc:creator>Georg Hinselmann</dc:creator>
                <dc:creator>Andreas Zell</dc:creator>
                <dc:source>Journal of Cheminformatics 2010, 2:2</dc:source>
        <dc:date>2010-03-11T00:00:00Z</dc:date>
        <dc:identifier>doi:10.1186/1758-2946-2-2</dc:identifier>
        <prism:publicationName>Journal of Cheminformatics</prism:publicationName>
        <prism:issn>1758-2946</prism:issn>
        <prism:volume>2</prism:volume>
        <prism:startingPage>2</prism:startingPage>
        <prism:publicationDate>2010-03-11T00:00:00Z</prism:publicationDate>
                <prism:versionidentifier>PDF</prism:versionidentifier>
                <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
    </item>
        <item rdf:about="http://www.jcheminf.com/content/1/1/15">
        <title>Application of the PM6 semi-empirical method to modeling proteins enhances docking accuracy of AutoDock</title>
        <description>Background:
Molecular docking methods are commonly used for predicting binding modes and energies of ligands to proteins. For accurate complex geometry and binding energy estimation, an appropriate method for calculating partial charges is essential. AutoDockTools software, the interface for preparing input files for one of the most widely used docking programs AutoDock 4, utilizes the Gasteiger partial charge calculation method for both protein and ligand charge calculation. However, it has already been shown that more accurate partial charge calculation - and as a consequence, more accurate docking- can be achieved by using quantum chemical methods. For docking calculations quantum chemical partial charge calculation as a routine was only used for ligands so far. The newly developed Mozyme function of MOPAC2009 allows fast partial charge calculation of proteins by quantum mechanical semi-empirical methods. Thus, in the current study, the effect of semi-empirical quantum-mechanical partial charge calculation on docking accuracy could be investigated.
Results:
The docking accuracy of AutoDock 4 using the original AutoDock scoring function was investigated on a set of 53 protein ligand complexes using Gasteiger and PM6 partial charge calculation methods. This has enabled us to compare the effect of the partial charge calculation method on docking accuracy utilizing AutoDock 4 software. Our results showed that the docking accuracy in regard to complex geometry (docking result defined as accurate when the RMSD of the first rank docking result complex is within 2 &#197; of the experimentally determined X-ray structure) significantly increased when partial charges of the ligands and proteins were calculated with the semi-empirical PM6 method.Out of the 53 complexes analyzed in the course of our study, the geometry of 42 complexes were accurately calculated using PM6 partial charges, while the use of Gasteiger charges resulted in only 28 accurate geometries. The binding affinity estimation was not influenced by the partial charge calculation method - for more accurate binding affinity prediction development of a new scoring function for AutoDock is needed.
Conclusion:
Our results demonstrate that the accuracy of determination of complex geometry using AutoDock 4 for docking calculation greatly increases with the use of quantum chemical partial charge calculation on both the ligands and proteins.</description>
        <link>http://www.jcheminf.com/content/1/1/15</link>
                <dc:creator>Zsolt Bikadi</dc:creator>
                <dc:creator>Eszter Hazai</dc:creator>
                <dc:source>Journal of Cheminformatics 2009, 1:15</dc:source>
        <dc:date>2009-09-11T00:00:00Z</dc:date>
        <dc:identifier>doi:10.1186/1758-2946-1-15</dc:identifier>
        <prism:publicationName>Journal of Cheminformatics</prism:publicationName>
        <prism:issn>1758-2946</prism:issn>
        <prism:volume>1</prism:volume>
        <prism:startingPage>15</prism:startingPage>
        <prism:publicationDate>2009-09-11T00:00:00Z</prism:publicationDate>
                <prism:versionidentifier>XML</prism:versionidentifier>
                <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
    </item>
        <cc:License rdf:about="http://creativecommons.org/licenses/by/2.0/">
        <cc:permits rdf:resource="http://creativecommons.org/ns#Reproduction" />
        <cc:permits rdf:resource="http://creativecommons.org/ns#Distribution" />
        <cc:permits rdf:resource="http://creativecommons.org/ns#DerivativeWorks" />
    </cc:License>
</rdf:RDF>
