A comparative study on methods of optimal sample preparation for the analysis of oligonucleotides by matrix-assisted laser desorption/ionization mass spectrometry

Metal adducts (e.g., Na+ and K+) significantly hinder the analysis of oligonucleotides by matrix-assisted laser desorption/ionization time-of-flight mass spectrometry (MALDI-TOF-MS). Although a number of sample purification methods exist, to date no comparative study exists to determine the most efficient method for purifying oligonucleotides. The objective of this work was to perform such a study. Several different oligonucleotide samples were synthesized. Aliquots of these samples were then purposely contaminated with sodium acetate to generate representative contaminated (salted) oligonucleotide samples. A number of popular oligonucleotide purification techniques were then tested as to their effectiveness at removing Na+ from the salted samples. The effectiveness of Na+ removal was qualitatively assessed by comparing the MALDI mass spectra of the original sample, the salted sample, and the salted sample after purification. Micropipet tips packed with C18 reversed-phase packing material (e.g., Zip Tips) appear to be the most effective means of purifying the oligonucleotides investigated. Minidialysis was found to be an effective alternative for purifying higher molecular weight oligonucleotides (> 10,000 u).     

Avoiding abelian squares in partial words

Erd?s raised the question whether there exist infinite abelian square-free words over a given alphabet, that is, words in which no two adjacent subwords are permutations of each other. It can easily be checked that no such word exists over a three-letter alphabet. However, infinite abelian square-free words have been constructed over alphabets of sizes as small as four. In this paper, we investigate the problem of avoiding abelian squares in partial words, or sequences that may contain some holes. In particular, we give lower and upper bounds for the number of letters needed to construct infinite abelian square-free partial words with finitely or infinitely many holes. Several of our constructions are based on iterating morphisms. In the case of one hole, we prove that the minimal alphabet size is four, while in the case of more than one hole, we prove that it is five. We also investigate the number of partial words of length n with a fixed number of holes over a five-letter alphabet that avoid abelian squares and show that this number grows exponentially with n.     

The effect of non-linear delay costs on workforce mix

This paper formulates a simple model to examine the appropriate mix of dedicated and flexible maintenance technicians (servers) required when total delay cost is a non-linear function of mean delay time. The primary decision variable is the number of flexible servers needed to minimize system-related costs. Non-linear delay costs appear to significantly increase the level of cross-training required compared with previous research using a linear cost function, which showed that a small proportion of flexible servers was sufficient. This has important implications for service system designers in regard to the amount of cross-training that might be appropriate.     

CO‐irredundant Ramsey numbers for graphs

The study of the CO‐irredundant Ramsey numbers t(n₁, ···, n_k) is initiated. It is shown that several values and bounds for these numbers may be obtained from the well‐studied generalized graph Ramsey numbers and the values of t(4, 5), t(4, 6) and t(3, 3, m) are calculated. © 2000 John Wiley & Sons, Inc. J Graph Theory 34: 258–268, 2000     

First observation of F

We measured the excitation function for ¹³O + p elastic scattering to obtain data on the unknown ¹⁴F nucleus. The ground state and several low-lying excited states in ¹⁴F were observed and spin/parity assignments were made. ¹⁴F appears to be much less unstable than was predicted. We compare theoretical predictions for the ¹⁴F level scheme with the experimental results.     

Another look at complete positivity in generalized quantum dynamics: Reply to Raggio and Primas

In this rejoinder to a critique by Raggio and Primas of our paper, On Completely Positive Maps in Generalized Quantum Dynamics, we acknowledge that, contrary to our original assertion, the Bloch equations are indeed completely positive. We then explain briefly why this modification of our analysis does not alter its main conclusions.