Efficient Computation of Geometries for Gold Complexes.
Ontology highlight
ABSTRACT:
SUBMITTER: Leach IF
PROVIDER: S-EPMC8252628 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:BACKGROUND: The most frequently used tools in bioinformatics are those searching for similarities, or local alignments, between biological sequences. Since the exact dynamic programming algorithm is quadratic, linear-time heuristics such as BLAST are used. Spaced seeds are much more sensitive than the consecutive seed of BLAST and using several seeds represents the current state of the art in approximate search for biological sequences. The most important aspect is computing highly sensitive seeds. Since the problem seems hard, heuristic algorithms are used. The leading software in the common Bernoulli model is the SpEED program. FINDINGS: SpEED uses a hill climbing method based on the overlap complexity heuristic. We propose a new algorithm for this heuristic that improves its speed by over one order of magnitude. We use the new implementation to compute improved seeds for several software programs. We compute as well multiple seeds of the same weight as MegaBLAST, that greatly improve its sensitivity. CONCLUSION: Multiple spaced seeds are being successfully used in bioinformatics software programs. Enabling researchers to compute very fast high quality seeds will help expanding the range of their applications.
| S-EPMC3392737 | biostudies-literature
Project description:Optimal choice of actions is a fundamental problem relevant to fields as diverse as neuroscience, psychology, economics, computer science, and control engineering. Despite this broad relevance the abstract setting is similar: we have an agent choosing actions over time, an uncertain dynamical system whose state is affected by those actions, and a performance criterion that the agent seeks to optimize. Solving problems of this kind remains hard, in part, because of overly generic formulations. Here, we propose a more structured formulation that greatly simplifies the construction of optimal control laws in both discrete and continuous domains. An exhaustive search over actions is avoided and the problem becomes linear. This yields algorithms that outperform Dynamic Programming and Reinforcement Learning, and thereby solve traditional problems more efficiently. Our framework also enables computations that were not possible before: composing optimal control laws by mixing primitives, applying deterministic methods to stochastic systems, quantifying the benefits of error tolerance, and inferring goals from behavioral data via convex optimization. Development of a general class of easily solvable problems tends to accelerate progress--as linear systems theory has done, for example. Our framework may have similar impact in fields where optimal choice of actions is relevant.
| S-EPMC2705278 | biostudies-literature
Project description:The synthesis of linear symmetric ethynyl- and acetylide-amidinates of the coinage metals is presented. Starting with the desilylation of the complexes [{Me3 SiC?CC(NDipp)2 }2 M2 ] (Dipp=2,6-diisopropylphenyl) (M=Cu, Au) it is demonstrated that this compound class is suitable to serve as a versatile metalloligand. Deprotonation with n-butyllithium and subsequent salt metathesis reactions yield symmetric tetranuclear gold(I) acetylide complexes of the form [{(PPh3 )AuC?CC(NDipp)2 }2 M2 ] (M=Cu, Au). The corresponding Ag complex [{(PPh3 )AuC?CC(NDipp)2 }2 Ag2 ] was obtained by a different route via metal rearrangement. All compounds show bright blue or blue-green microsecond long phosphorescence in the solid state, hence their photophysical properties were thoroughly investigated in a temperature range of 20-295?K. Emission quantum yields of up to 41?% at room temperature were determined. Furthermore, similar emissions with quantum yields of 15?% were observed for the two most brightly luminescent complexes in thf solution.
| S-EPMC7756867 | biostudies-literature
Project description:We present an algorithm that calculates the optimal binding conformation and free energy of two RNA molecules, one or both oligomeric. This algorithm has applications to modeling DNA microarrays, RNA splice-site recognitions and other antisense problems. Although other recent algorithms perform the same calculation in time proportional to the sum of the lengths cubed, O((N1 + N2)3), our oligomer binding algorithm, called bindigo, scales as the product of the sequence lengths, O(N1*N2). The algorithm performs well in practice with the aid of a heuristic for large asymmetric loops. To demonstrate its speed and utility, we use bindigo to investigate the binding proclivities of U1 snRNA to mRNA donor splice sites.
| S-EPMC545450 | biostudies-literature
Project description:We define a new family of similarity and distance measures on graphs, and explore their theoretical properties in comparison to conventional distance metrics. These measures are defined by the solution(s) to an optimization problem which attempts find a map minimizing the discrepancy between two graph Laplacian exponential matrices, under norm-preserving and sparsity constraints. Variants of the distance metric are introduced to consider such optimized maps under sparsity constraints as well as fixed time-scaling between the two Laplacians. The objective function of this optimization is multimodal and has discontinuous slope, and is hence difficult for univariate optimizers to solve. We demonstrate a novel procedure for efficiently calculating these optima for two of our distance measure variants. We present numerical experiments demonstrating that (a) upper bounds of our distance metrics can be used to distinguish between lineages of related graphs; (b) our procedure is faster at finding the required optima, by as much as a factor of 103; and (c) the upper bounds satisfy the triangle inequality exactly under some assumptions and approximately under others. We also derive an upper bound for the distance between two graph products, in terms of the distance between the two pairs of factors. Additionally, we present several possible applications, including the construction of infinite "graph limits" by means of Cauchy sequences of graphs related to one another by our distance measure.
| S-EPMC8078789 | biostudies-literature
Project description:We show that many complex gold nanostructures such as the water chestnut, dog bone, nanobar, and octahedron, which are not easily accessible via a direct seed-growth synthesis approach, can be prepared via overgrowth of the same gold nanorods by varying pH and Ag concentrations in the growth solution. Overgrown nanostructures' shapes were determined by the rate of gold atom deposition, which is faster at higher pH. In the presence of AgNO3, codeposition of gold and silver atoms affects the shapes of overgrown nanostructures, particularly at high pH.
| S-EPMC6714510 | biostudies-literature
Project description:Cationic gold vinyl carbene/allylic cation complexes of the form (E)-[(L)AuC(H)C(H)CAr2]+ OTf- {L = IPr, Ar = Ph [(E)-5a], L = IPr, Ar = 4-C6H4OMe [(E)-5b], L = P(t-Bu)2 o-biphenyl, Ar = 4-C6H4OMe [(E)-5c]} were generated in solution via Lewis acid-mediated ionization of the corresponding gold (γ-methoxy)vinyl complexes (E)-(L)AuC(H)C(H)C(OMe)Ar2 at or below -95 °C. Complexes (E)-5b and (E)-5c were fully characterized in solution employing multinuclear NMR spectroscopy, which established the predominant contribution of the aurated allylic cation resonance structure and the significant distribution of positive charge into the γ-anisyl rings. Complex (E)-5b reacted rapidly at -95 °C with neutral two-electron, hydride, and oxygen atom donors exclusively at the C1 position of the vinyl carbene moiety and with p-methoxystyrene to form the corresponding vinylcyclopropane. In the absence of nucleophile (E)-5a decomposed predominantly via intermolecular carbene dimerization whereas formation of 1-aryl-5-methoxy indene upon ionization of (Z)-(IPr)AuC(H)C(H)C(OMe)(4-C6H4OMe)2 [(Z)-6b] implicated an intramolecular Friedel-Crafts or electrocyclic Nazarov pathway for the decomposition of the unobserved vinyl carbene complex (Z)-[(IPr)AuC(H)C(H)C(4-C6H4OMe)2]+ OTf- [(Z)-5b].
| S-EPMC6585879 | biostudies-literature
Project description:PSEUDOMARKER is a software package that performs joint linkage and linkage disequilibrium analysis between a marker and a putative disease locus. A key feature of PSEUDOMARKER is that it can combine case-controls and pedigrees of varying structure into a single unified analysis. Thus it maximizes the full likelihood of the data over marker allele frequencies or conditional allele frequencies on disease and recombination fraction.The new version 2.0 uses the software package NOMAD to maximize likelihoods, resulting in generally comparable or better optima with many fewer evaluations of the likelihood functions.After being modified substantially to use modern optimization methods, PSEUDOMARKER version 2.0 is more robust and substantially faster than version 1.0. NOMAD may be useful in other bioinformatics problems where complex likelihood functions are optimized.
| S-EPMC3932042 | biostudies-literature
Project description:BACKGROUND: Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon usage, and so on. Unique subsequences are markers of special interest in genome comparison, expression profiling, and genetic engineering. Relative to a random sequence of the same length, unique subsequences are overrepresented in real genomes. Shortest words absent from a genome have been addressed in two recent studies. RESULTS: We describe a new algorithm and software for the computation of absent words. It is more efficient than previous algorithms and easier to use. It directly computes unwords without the need to specify a length estimate. Moreover, it avoids the space requirements of index structures such as suffix trees and suffix arrays. Our implementation is available as an open source package. We compute unwords of human and mouse as well as some other organisms, covering a genome size range from 109 down to 105 bp. CONCLUSION: The new algorithm computes absent words for the human genome in 10 minutes on standard hardware, using only 2.5 Mb of space. This enables us to perform this type of analysis not only for the largest genomes available so far, but also for the emerging pan- and meta-genome data.
| S-EPMC2375138 | biostudies-literature
Project description:BACKGROUND:How small, fast-growing bacteria ensure tight cell-size distributions remains elusive. High-throughput measurement techniques have propelled efforts to build modeling tools that help to shed light on the relationships between cell size, growth and cycle progression. Most proposed models describe cell division as a discrete map between size at birth and size at division with stochastic fluctuations assumed. However, such models underestimate the role of cell size transient dynamics by excluding them. RESULTS:We propose an efficient approach for estimation of cell size transient dynamics. Our technique approximates the transient size distribution and statistical moment dynamics of exponential growing cells following an adder strategy with arbitrary precision. CONCLUSIONS:We approximate, up to arbitrary precision, the distribution of division times and size across time for the adder strategy in rod-shaped bacteria cells. Our approach is able to compute statistical moments like mean size and its variance from such distributions efficiently, showing close match with numerical simulations. Additionally, we observed that these distributions have periodic properties. Our approach further might shed light on the mechanisms behind gene product homeostasis.
| S-EPMC6933677 | biostudies-literature