Browse
Submit Data
Databases
API
Help

Dataset Information

28 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Lower Bounds for Nonrelativistic Atomic Energies.

ABSTRACT: A recently developed lower bound theory for Coulombic problems (E. Pollak, R. Martinazzo, J. Chem. Theory Comput. 2021, 17, 1535) is further developed and applied to the highly accurate calculation of the ground-state energy of two- (He, Li⁺, and H^-) and three- (Li) electron atoms. The method has been implemented with explicitly correlated many-particle basis sets of Gaussian type, on the basis of the highly accurate (Ritz) upper bounds they can provide with relatively small numbers of functions. The use of explicitly correlated Gaussians is developed further for computing the variances, and the necessary modifications are here discussed. The computed lower bounds are of submilli-Hartree (parts per million relative) precision and for Li represent the best lower bounds ever obtained. Although not yet as accurate as the corresponding (Ritz) upper bounds, the computed bounds are orders of magnitude tighter than those obtained with other lower bound methods, thereby demonstrating that the proposed method is viable for lower bound calculations in quantum chemistry applications. Among several aspects, the optimization of the wave function is shown to play a key role for both the optimal solution of the lower bound problem and the internal check of the theory.

SUBMITTER: Ireland RT

PROVIDER: S-EPMC8796283 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

Improved lower bounds of DNA tags based on a modified genetic algorithm.

Project description:The well-known massively parallel sequencing method is efficient and it can obtain sequence data from multiple individual samples. In order to ensure that sequencing, replication, and oligonucleotide synthesis errors do not result in tags (or barcodes) that are unrecoverable or confused, the tag sequences should be abundant and sufficiently different. Recently, many design methods have been proposed for correcting errors in data using error-correcting codes. The existing tag sets contain small tag sequences, so we used a modified genetic algorithm to improve the lower bound of the tag sets in this study. Compared with previous research, our algorithm is effective for designing sets of DNA tags. Moreover, the GC content determined by existing methods includes an imprecise range. Thus, we improved the GC content determination method to obtain tag sets that control the GC content in a more precise range. Finally, previous studies have only considered perfect self-complementarity. Thus, we considered the crossover between different tags and introduced an improved constraint into the design of tag sets.

| S-EPMC4332859 | biostudies-literature

Atomic structures and orbital energies of 61,489 crystal-forming organic molecules.

Project description:Data science and machine learning in materials science require large datasets of technologically relevant molecules or materials. Currently, publicly available molecular datasets with realistic molecular geometries and spectral properties are rare. We here supply a diverse benchmark spectroscopy dataset of 61,489 molecules extracted from organic crystals in the Cambridge Structural Database (CSD), denoted OE62. Molecular equilibrium geometries are reported at the Perdew-Burke-Ernzerhof (PBE) level of density functional theory (DFT) including van der Waals corrections for all 62 k molecules. For these geometries, OE62 supplies total energies and orbital eigenvalues at the PBE and the PBE hybrid (PBE0) functional level of DFT for all 62 k molecules in vacuum as well as at the PBE0 level for a subset of 30,876 molecules in (implicit) water. For 5,239 molecules in vacuum, the dataset provides quasiparticle energies computed with many-body perturbation theory in the G0W0 approximation with a PBE0 starting point (denoted GW5000 in analogy to the GW100 benchmark set (M. van Setten et al. J. Chem. Theory Comput. 12, 5076 (2016))).

| S-EPMC7029047 | biostudies-literature

Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies.

Project description:BACKGROUND: Enumeration of chemical graphs satisfying given constraints is one of the fundamental problems in chemoinformatics and bioinformatics since it leads to a variety of useful applications including structure determination of novel chemical compounds and drug design. RESULTS: In this paper, we consider the problem of enumerating all tree-like chemical graphs from a given set of feature vectors, which is specified by a pair of upper and lower feature vectors, where a feature vector represents the frequency of prescribed paths in a chemical compound to be constructed. This problem can be solved by applying the algorithm proposed by Ishida et al. to each single feature vector in the given set, but this method may take much computation time because in general there are many feature vectors in a given set. We propose a new exact branch-and-bound algorithm for the problem so that all the feature vectors in a given set are handled directly. Since we cannot use the bounding operation proposed by Ishida et al. due to upper and lower constraints, we introduce new bounding operations based on upper and lower feature vectors, a bond constraint, and a detachment condition. CONCLUSIONS: Our proposed algorithm is useful for enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies.

| S-EPMC3287468 | biostudies-literature

Close lower and upper bounds for the minimum reticulate network of multiple phylogenetic trees.

Project description:MotivationReticulate network is a model for displaying and quantifying the effects of complex reticulate processes on the evolutionary history of species undergoing reticulate evolution. A central computational problem on reticulate networks is: given a set of phylogenetic trees (each for some region of the genomes), reconstruct the most parsimonious reticulate network (called the minimum reticulate network) that combines the topological information contained in the given trees. This problem is well-known to be NP-hard. Thus, existing approaches for this problem either work with only two input trees or make simplifying topological assumptions.ResultsWe present novel results on the minimum reticulate network problem. Unlike existing approaches, we address the fully general problem: there is no restriction on the number of trees that are input, and there is no restriction on the form of the allowed reticulate network. We present lower and upper bounds on the minimum number of reticulation events in the minimum reticulate network (and infer an approximately parsimonious reticulate network). A program called PIRN implements these methods, which also outputs a graphical representation of the inferred network. Empirical results on simulated and biological data show that our methods are practical for a wide range of data. More importantly, the lower and upper bounds match for many datasets (especially when the number of trees is small or reticulation level is low), and this allows us to solve the minimum reticulate network problem exactly for these datasets.AvailabilityA software tool, PIRN, is available for download from the web page: http://www.engr.uconn.edu/~ywu.Supplementary informationSupplementary data is available at Bioinformatics online.

| S-EPMC2881383 | biostudies-literature

Lower bounds to eigenvalues of the Schrodinger equation by solution of a 90-y challenge.

Project description:The Ritz upper bound to eigenvalues of Hermitian operators is essential for many applications in science. It is a staple of quantum chemistry and physics computations. The lower bound devised by Temple in 1928 [G. Temple, Proc. R. Soc. A Math. Phys. Eng. Sci. 119, 276-293 (1928)] is not, since it converges too slowly. The need for a good lower-bound theorem and algorithm cannot be overstated, since an upper bound alone is not sufficient for determining differences between eigenvalues such as tunneling splittings and spectral features. In this paper, after 90 y, we derive a generalization and improvement of Temple's lower bound. Numerical examples based on implementation of the Lanczos tridiagonalization are provided for nontrivial lattice model Hamiltonians, exemplifying convergence over a range of 13 orders of magnitude. This lower bound is typically at least one order of magnitude better than Temple's result. Its rate of convergence is comparable to that of the Ritz upper bound. It is not limited to ground states. These results complement Ritz's upper bound and may turn the computation of lower bounds into a staple of eigenvalue and spectral problems in physics and chemistry.

| S-EPMC7368311 | biostudies-literature

Quantifying Chemical Structure and Machine-Learned Atomic Energies in Amorphous and Liquid Silicon.

Project description:Amorphous materials are being described by increasingly powerful computer simulations, but new approaches are still needed to fully understand their intricate atomic structures. Here, we show how machine-learning-based techniques can give new, quantitative chemical insight into the atomic-scale structure of amorphous silicon (a-Si). We combine a quantitative description of the nearest- and next-nearest-neighbor structure with a quantitative description of local stability. The analysis is applied to an ensemble of a-Si networks in which we tailor the degree of ordering by varying the quench rates down to 1010 ?K?s-1 . Our approach associates coordination defects in a-Si with distinct stability regions and it has also been applied to liquid Si, where it traces a clear-cut transition in local energies during vitrification. The method is straightforward and inexpensive to apply, and therefore expected to have more general significance for developing a quantitative understanding of liquid and amorphous states of matter.

| S-EPMC6563111 | biostudies-literature

Solvation Free Energies for Aqueous and Nonaqueous Solutions Computed Using PM7 Atomic Charges.

Project description:We describe a simple and accurate method, ESE-PM7, for calculating solvation free energies ΔGsolv° in aqueous and nonaqueous solutions. The method is based on a noniterative COSMO algorithm. Molecular geometries and atomic charges calculated using the semiempirical method PM7 are used to calculate ΔGsolv°. The method has been tested on 92 different solvents and 988 solutes. The mean absolute errors (MAEs) in ΔGsolv° in aqueous solutions estimated by the ESE-PM7 approach are found to be 1.62 kcal/mol for 389 neutral solutes and 3.06 kcal/mol for 139 ions. The MAEs for neutral molecules in organic solvents are 0.97, 0.74, and 0.51 kcal/mol in polar protic, polar aprotic, and nonpolar solvents, respectively. The developed method can be employed to quickly screen ΔGsolv° values of extended molecular systems including pharmaceutical and biological molecules.

| S-EPMC8479861 | biostudies-literature

Designed azurins show lower reorganization free energies for intraprotein electron transfer.

Project description:Low reorganization free energies are necessary for fast electron transfer (ET) reactions. Hence, rational design of redox proteins with lower reorganization free energies has been a long-standing challenge, promising to yield a deeper understanding of the underlying principles of ET reactivity and to enable potential applications in different energy conversion systems. Herein we report studies of the intramolecular ET from pulse radiolytically produced disulfide radicals to Cu(II) in rationally designed azurin mutants. In these mutants, the copper coordination sphere has been fine-tuned to span a wide range of reduction potentials while leaving the metal binding site effectively undisrupted. We find that the reorganization free energies of ET within the mutants are indeed lower than that of WT azurin, increasing the intramolecular ET rate constants almost 10-fold: changes that are correlated with increased flexibility of their copper sites. Moreover, the lower reorganization free energy results in the ET rate constants reaching a maximum value at higher driving forces, as predicted by the Marcus theory.

| S-EPMC3696782 | biostudies-literature

The lower bounds for the rank of matrices and some sufficient conditions for nonsingular matrices.

Project description:The paper mainly discusses the lower bounds for the rank of matrices and sufficient conditions for nonsingular matrices. We first present a new estimation for [Formula: see text] ([Formula: see text] is an eigenvalue of a matrix) by using the partitioned matrices. By using this estimation and inequality theory, the new and more accurate estimations for the lower bounds for the rank are deduced. Furthermore, based on the estimation for the rank, some sufficient conditions for nonsingular matrices are obtained.

| S-EPMC5519689 | biostudies-other

Possibilistic Bounds for Granular Counting

Project description:Uncertain data are observations that cannot be uniquely mapped to a referent. In the case of uncertainty due to incompleteness, possibility theory can be used as an appropriate model for processing such data. In particular, granular counting is a way to count data in presence of uncertainty represented by possibility distributions. Two algorithms were proposed in literature to compute granular counting: exact granular counting, with quadratic time complexity, and approximate granular counting, with linear time complexity. This paper extends approximate granular counting by computing bounds for exact granular count. In this way, the efficiency of approximate granular count is combined with certified bounds whose width can be adjusted in accordance to user needs.

| S-EPMC7274672 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data