The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
cclib: A library for package‐independent computational chemistry algorithms
Abstract
There are now a wide variety of packages for electronic structure calculations, each of which differs in the algorithms implemented and the output format. Many computational chemistry algorithms are only available to users of a particular package despite being generally applicable to the results of calculations by any package. Here we present cclib, a platform for the development of package‐independent computational chemistry algorithms. Files from several versions of multiple electronic structure packages are automatically detected, parsed, and the extracted information converted to a standard internal representation. A number of population analysis algorithms have been implemented as a proof of principle. In addition, cclib is currently used as an input filter for two GUI applications that analyze output files: PyMOlyze and GaussSum. © 2007 Wiley Periodicals, Inc. J Comput Chem, 2008
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
General atomic and molecular electronic structure system
Schmidt, M. W., Baldridge, K. K., Boatz, J. A., Elbert, S. T., Gordon, M. S., Jensen, J. H., Koseki, S., Matsunaga, N., Nguyen, K. A., Su, S., et al. (1993) · Journal of Computational Chemistry · doi:10.1002/jcc.540141112 · Cited by 20,204
Electronic Population Analysis on LCAO–MO Molecular Wave Functions. I
Mulliken, R. S. (1955) · The Journal of Chemical Physics · doi:10.1063/1.1740588 · Cited by 11,049
te Velde, G., Bickelhaupt, F. M., Baerends, E. J., Fonseca Guerra, C., van Gisbergen, S. J. A., Snijders, J. G., & Ziegler, T. (2001) · Journal of Computational Chemistry · doi:10.1002/jcc.1056 · Cited by 10,152
Charge, bond order and valence in the AB initio SCF theory
Mayer, I. (1983) · Chemical Physics Letters · doi:10.1016/0009-2614(83)80005-0 · Cited by 2,267
Fonseca Guerra, C., Snijders, J. G., te Velde, G., & Baerends, E. J. (1998) · Theoretical Chemistry Accounts · doi:10.1007/s002140050021 · Cited by 1,507
Theory and applications of computational chemistry : the first forty years
Dykstra, C. E., Frenking, G., Kim, K. S., & Scuseria, G. E. (2005) · Cited by 1,483
The GAMESS-UK electronic structure package: algorithms, developments and applications
Guest *, M. F., Bush, I. J., Van Dam, H. J. J., Sherwood, P., Thomas, J. M. H., Van Lenthe, J. H., Havenith, R. W. A., & Kendrick, J. (2005) · Molecular Physics · doi:10.1080/00268970512331340592 · Cited by 514
The Blue Obelisk—Interoperability in Chemical Informatics
Guha, R., Howard, M. T., Hutchison, G. R., Murray-Rust, P., Rzepa, H., Steinbeck, C., Wegner, J., & Willighagen, E. L. (2006) · Journal of Chemical Information and Modeling · doi:10.1021/ci050400b · Cited by 389
Molecular Orbital Calculations on Copper Chloride Complexes
Ros, P., & Schuit, G. C. A. (1966) · Theoretical Chemistry Accounts · doi:10.1007/bf00526005 · Cited by 244
Cited by
Open Babel: An open chemical toolbox
O'Boyle, N. M., Banck, M., James, C. A., Morley, C., Vandermeersch, T., & Hutchison, G. R. (2011) · Journal of Cheminformatics · doi:10.1186/1758-2946-3-33 · Cited by 10,939
Self-citationNWChem: Past, present, and future
Aprà, E., Bylaska, E. J., de Jong, W. A., Govind, N., Kowalski, K., Straatsma, T. P., Valiev, M., van Dam, H. J. J., Alexeev, Y., Anchell, J., et al. (2020) · The Journal of Chemical Physics · doi:10.1063/5.0004997 · Cited by 714
Dias, F. B., Santos, J., Graves, D. R., Data, P., Nobuyasu, R. S., Fox, M. A., Batsanov, A. S., Palmeira, T., Berberan‐Santos, M. N., Bryce, M. R., et al. (2016) · Advanced Science · doi:10.1002/advs.201600080 · Cited by 524
TheoDORE: A toolbox for a detailed and automated analysis of electronic excited state computations
Plasser, F. (2020) · The Journal of Chemical Physics · doi:10.1063/1.5143076 · Cited by 476
Zhang, J., Li, H.-B., Sun, S.-L., Geng, Y., Wu, Y., & Su, Z.-M. (2012) · J. Mater. Chem. · doi:10.1039/c1jm13028e · Cited by 409
Metadata
- Authors
- O'boyle, N. M., Tenderholt, A. L., & Langner, K. M.
- Venue
- Journal of Computational Chemistry
- Publisher
- Wiley
- Published
- 2007-09-11
- Volume
- 29
- Issue
- 5
- Pages
- 839-845
- ISSN
- 0192-8651 (ISSN-L)
- 1096-987X
- OpenAlex
- W2106824077
- Cited by
- 6,175
- References
- 9
- FWCI
- 27.30
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.