A general solution for the 2-pyridyl problem.
Ontology highlight
ABSTRACT:
SUBMITTER: Dick GR
PROVIDER: S-EPMC3433254 | biostudies-literature | 2012 Mar
REPOSITORIES: biostudies-literature
Publications
A general solution for the 2-pyridyl problem.
Dick Graham R GR Woerly Eric M EM Burke Martin D MD
Angewandte Chemie (International ed. in English) 20120127 11
Problem solved: an air-stable 2-pyridyl borane that can effectively couple to a wide range of aryl and heteroaryl halides and pseudohalides has evaded the synthesis community for decades. The discovery that Cu(DEA)(2) powerfully enables palladium-mediated cross-couplings with air-stable boronates 1 has finally provided a general solution to this problem. DEA=diethanolamine, DMF=N,N'-dimethylformamide, Tf=trifluoromethanesulfonyl. ...[more]
Similar Datasets
Project description:A general solution for the RS EPR deconvolution problem has been derived. This solution permits the use of arbitrary magnetic field scans. As a result, constraints on the current experimental designs can be lifted. For example, a trapezoidal waveform can be used to accelerate the scan rate without affecting the signal bandwidth. The assumptions made to develop the previous algorithms are mathematically validated.
| S-EPMC7575242 | biostudies-literature
Project description:Our global goal is that of synthesizing complex polypeptides and glycopeptides in homogeneous form. Chemistry-derived access to homogeneous biologics could well have useful consequences in the discovery of drugs and vaccines. The key finding in this study is that thio acids can become highly competent acyl donors following even trace levels of oxidative activation, thereby undergoing amide bond formation upon reaction with N-terminal peptides. Though our data set does not establish the specific mechanism of this reaction, a framework to account for the fact that minute levels of oxidation actuate amide bond formation with high turnover is offered. An apparently general coupling of thio acids (including complex peptide thio acids with N-termini of complex peptides) has thus been realized. These ligations are conducted with minimal ?-epimerization in the C-terminal group and allow for the coupling of N-terminal and C-terminal glycopeptides en route to homogeneous glycoproteins.
| S-EPMC3020898 | biostudies-literature
Project description:BackgroundA common challenge in bioinformatics is to identify short sub-sequences that are unique in a set of genomes or reference sequences, which can efficiently be achieved by k-mer (k consecutive nucleotides) counting. However, there are several areas that would benefit from a more stringent definition of "unique", requiring that these sub-sequences of length W differ by more than k mismatches (i.e. a Hamming distance greater than k) from any other sub-sequence, which we term the k-disjoint problem. Examples include finding sequences unique to a pathogen for probe-based infection diagnostics; reducing off-target hits for re-sequencing or genome editing; detecting sequence (e.g. phage or viral) insertions; and multiple substitution mutations. Since both sensitivity and specificity are critical, an exhaustive, yet efficient solution is desirable.ResultsWe present microTaboo, a method that allows for efficient and extensive sequence mining of unique (k-disjoint) sequences of up to 100 nucleotides in length. On a number of simulated and real data sets ranging from microbe- to mammalian-size genomes, we show that microTaboo is able to efficiently find all sub-sequences of a specified length W that do not occur within a threshold of k mismatches in any other sub-sequence. We exemplify that microTaboo has many practical applications, including point substitution detection, sequence insertion detection, padlock probe target search, and candidate CRISPR target mining.ConclusionsmicroTaboo implements a solution to the k-disjoint problem in an alignment- and assembly free manner. microTaboo is available for Windows, Mac OS X, and Linux, running Java 7 and higher, under the GNU GPLv3 license, at: https://MohammedAlJaff.github.io/microTaboo.
| S-EPMC5414201 | biostudies-literature
Project description:Participants aged 5;2-6;8, 9;2-10;6 and 18;1-22;2 (72 at each age) rated verb argument structure overgeneralization errors (e.g., *Daddy giggled the baby) using a five-point scale. The study was designed to investigate the feasibility of two proposed construction-general solutions to the question of how children retreat from, or avoid, such errors. No support was found for the prediction of the preemption hypothesis that the greater the frequency of the verb in the single most nearly synonymous construction (for this example, the periphrastic causative; e.g., Daddy made the baby giggle), the lower the acceptability of the error. Support was found, however, for the prediction of the entrenchment hypothesis that the greater the overall frequency of the verb, regardless of construction, the lower the acceptability of the error, at least for the two older groups. Thus while entrenchment appears to be a robust solution to the problem of the retreat from error, and one that generalizes across different error types, we did not find evidence that this is the case for preemption. The implication is that the solution to the retreat from error lies not with specialized mechanisms, but rather in a probabilistic process of construction competition.
| S-EPMC4412412 | biostudies-literature
Project description:The strongly NP-Hard Double Digest Problem, for reconstructing the physical map of DNA sequence, in now using for efficient genotyping. Most of the existing methods are inefficient in tackling large instances due to the large search space for the problem which grows as a factorial function (a!)(b!) of the numbers a and b of the DNA fragments generated by the two restriction enzymes. Also, none of the existing methods are able to handle the erroneous data. In this paper, we develop a novel method based on genetic algorithm for solving this problem and it is adapted to handle the erroneous data. Our genetic algorithm is implemented and compared with the other well-known existing algorithms. The obtained results show the efficiency (speedup) of our algorithm with respect to the other methods, specially for erroneous data.
| S-EPMC3374354 | biostudies-literature
Project description:The Kirchhoff-Plateau problem concerns the equilibrium shapes of a system in which a flexible filament in the form of a closed loop is spanned by a liquid film, with the filament being modeled as a Kirchhoff rod and the action of the spanning surface being solely due to surface tension. We establish the existence of an equilibrium shape that minimizes the total energy of the system under the physical constraint of noninterpenetration of matter, but allowing for points on the surface of the bounding loop to come into contact. In our treatment, the bounding loop retains a finite cross-sectional thickness and a nonvanishing volume, while the liquid film is represented by a set with finite two-dimensional Hausdorff measure. Moreover, the region where the liquid film touches the surface of the bounding loop is not prescribed a priori. Our mathematical results substantiate the physical relevance of the chosen model. Indeed, no matter how strong is the competition between surface tension and the elastic response of the filament, the system is always able to adjust to achieve a configuration that complies with the physical constraints encountered in experiments.
| S-EPMC5479363 | biostudies-other
Project description:Traveling salesman problem (TSP) is a decision-making problem that is essential for a number of practical applications. Today, this problem is solved on digital computers exploiting Boolean-type architecture by checking one by one a number of possible routes. In this work, we describe a special type of hardware for the TSP solution. It is a magnonic combinatorial device comprising magnetic and electric parts connected in the active ring circuit. There is a number of possible propagation routes in the magnetic mesh made of phase shifters, frequency filters, and attenuators. The phase shifters mimic cities in TSP while the distance between the cities is encoded in the signal attenuation. The set of frequency filters makes the waves on different frequencies propagate through the different routes. The principle of operation is based on the classical wave superposition. There is a number of waves coming in all possible routes in parallel accumulating different phase shifts and amplitude damping. However, only the wave(s) that accumulates the certain phase shift will be amplified by the electric part. The amplification comes first to the waves that possess the minimum propagation losses. It makes this type of device suitable for TSP solution, where waves are similar to the salesmen traveling in all possible routes at a time. We present the results of numerical modeling illustrating the TSP solutions for four and six cities. Also, we present experimental data for the TSP solution with four cities. The prototype device is built of commercially available components including magnetic phase shifters/filters, coaxial cables, splitters, attenuators, and a broadband amplifier. There are three examples of finding the shortest route between the cities for three different sets of city-to-city distances. The proposed approach is scalable to TSP with a larger number of cities. Physical limits and challenges are also discussed.
| S-EPMC10359328 | biostudies-literature
Project description:Signaling receptors on the cell surface are mobile and have evolved to efficiently sense and process mechanical or chemical information. We pose the problem of identifying the optimal strategy for placing a collection of distributed and mobile sensors to faithfully estimate a signal that varies in space and time. The optimal strategy has to balance two opposing objectives: the need to locally assemble sensors to reduce estimation noise and the need to spread them to reduce spatial error. This results in a phase transition in the space of strategies as a function of sensor density and efficiency. We show that these optimal strategies have been arrived at multiple times in diverse cell biology contexts, including the stationary lattice architecture of receptors on the bacterial cell surface and the active clustering of cell-surface signaling receptors in metazoan cells.
| S-EPMC4151762 | biostudies-literature
Project description:In this work, a numerical solution for the extrapolation problem of a discrete set of n values of an unknown analytic function is developed. The proposed method is based on a novel numerical scheme for the rapid calculation of higher order derivatives, exhibiting high accuracy, with error magnitude of O(10-100) or less. A variety of integrated radial basis functions are utilized for the solution, as well as variable precision arithmetic for the calculations. Multiple alterations in the function's direction, with no curvature or periodicity information specified, are efficiently foreseen. Interestingly, the proposed procedure can be extended in multiple dimensions. The attained extrapolation spans are greater than two times the given domain length. The significance of the approximation errors is comprehensively analyzed and reported, for 5832 test cases.
| S-EPMC6750076 | biostudies-literature
Project description:The investigation of genetic clusters in natural populations is an ubiquitous problem in a range of fields relying on the analysis of genetic data, such as molecular ecology, conservation biology and microbiology. Typically, genetic clusters are defined as distinct panmictic populations, or parental groups in the context of hybridisation. Two types of methods have been developed for identifying such clusters: model-based methods, which are usually computer-intensive but yield results which can be interpreted in the light of an explicit population genetic model, and geometric approaches, which are less interpretable but remarkably faster.Here, we introduce snapclust, a fast maximum-likelihood solution to the genetic clustering problem, which allies the advantages of both model-based and geometric approaches. Our method relies on maximising the likelihood of a fixed number of panmictic populations, using a combination of geometric approach and fast likelihood optimisation, using the Expectation-Maximisation (EM) algorithm. It can be used for assigning genotypes to populations and optionally identify various types of hybrids between two parental populations. Several goodness-of-fit statistics can also be used to guide the choice of the retained number of clusters.Using extensive simulations, we show that snapclust performs comparably to current gold standards for genetic clustering as well as hybrid detection, with some advantages for identifying hybrids after several backcrosses, while being orders of magnitude faster than other model-based methods. We also illustrate how snapclust can be used for identifying the optimal number of clusters, and subsequently assign individuals to various hybrid classes simulated from an empirical microsatellite dataset. snapclust is implemented in the package adegenet for the free software R, and is therefore easily integrated into existing pipelines for genetic data analysis. It can be applied to any kind of co-dominant markers, and can easily be extended to more complex models including, for instance, varying ploidy levels. Given its flexibility and computer-efficiency, it provides a useful complement to the existing toolbox for the study of genetic diversity in natural populations.
| S-EPMC5993310 | biostudies-literature