A Biosilification Fusion Protein for a ‘Self‐immobilising’ Sarcosine Oxidase Amperometric Enzyme Biosensor

Monomeric sarcosine oxidase (mSOx) fusion with the silaffin peptide, R5, designed previously for easy protein production in low resource areas, was used in a biosilification process to form an enzyme layer electrode biosensor. mSOx is a low activity enzyme (10–20 U/mg) requiring high amounts of enzyme to obtain an amperometric biosensor signal, in the clinically useful range <1 mM sarcosine, especially since the K_m is >10 mM. An amperometric biosensor model was fitted to experimental data to investigate dynamic range. mSOx constructs were designed with 6H (6×histidine) and R5 (silaffin) peptide tags and compared with native mSOx. Glutaraldehyde (GA) cross‐linked proteins retained ～5 % activity for mSOx and mSOx‐6H and only 0.5 % for mSOx‐R5. In contrast R5 catalysed biosilification on (3‐mercaptopropyl) trimethoxysilane (MPTMS) and tetramethyl orthosilicate (TMOS) particles created a ‘self‐immobilisation’ matrix retaining 40 % and 76 % activity respectively. The TMOS matrix produced a thick layer (>500 μm) on a glassy carbon electrode with a mediated current due to sarcosine in the clinical range for sarcosinemia (0–1 mM). The mSOx‐R5 fusion protein was also used to catalyse biosilification in the presence of creatinase and creatininase, entrapping all three enzymes. A mediated GC enzyme linked current was obtained with dynamic range available for creatinine determination of 0.1–2 mM for an enzyme layer ～800 nm.     

Near-Ultraviolet Circular Dichroism and Two-Dimensional Spectroscopy of Polypeptides

A fully quantitative theory of the relationship between protein conformation and optical spectroscopy would facilitate deeper insights into biophysical and simulation studies of protein dynamics and folding. In contrast to intense bands in the far-ultraviolet, near-UV bands are much weaker and have been challenging to compute theoretically. We report some advances in the accuracy of calculations in the near-UV, which were realised through the consideration of the vibrational structure of the electronic transitions of aromatic side chains.     

Student-Invented Numeration Systems: Pattern-Analysis and Mathematical Understanding

Thirteen fifth graders were given an assignment to invent their own numeration systems, following a unit on bases and a look at early events in the history of numbers. The task presented options that required the students to make decisions (such as whether to use a base, which base to use, design of symbols, etc.), and build a rationale for the elements of their system. Analyses of patterns embedded in their invented systems provided an assessment of student understanding of numeration. The progression of more and less complex thinking related to the student's choice of a base other than 10, consistency of logic throughout the system in words and symbols, rationale for change, and perception of real life examples that would change if the system was adopted. The invention task is presented as another way to make connections.     

Randomized greedy matching

We consider a randomized version of the greedy algorithm for finding a large matching in a graph. We assume that the next edge is always randomly chosen from those remaining. We analyze the performance of this algorithm when the input graph is fixed. We show that there are graphs for which this Randomized Greedy Algorithm (RGA) usually only obtains a matching close in size to that guaranteed by worst-case analysis (i.e., half the size of the maximum). For some classes of sparse graphs (e.g., planar graphs and forests) we show that the RGA performs significantly better than the worst-case. Our main theorem concerns forests. We prove that the ratio to maximum here is at least 0.7690…, and that this bound is tight.     

On isomorphic factorizations of circulant graphs

We investigate the conjecture that every circulant graph X admits a k‐isofactorization for every k dividing |E(X)|. We obtain partial results with an emphasis on small values of k. © 2006 Wiley Periodicals, Inc. J Combin Designs 14: 406–414, 2006     

Announcement of Proficiency Testing Schemes

Accreditation and Quality Assurance -     

Products of residue currents of Cauchy–Fantappiè–Leray type

With a given holomorphic section of a Hermitian vector bundle, one can associate a residue current by means of Cauchy–Fantappiè–Leray type formulas. In this paper we define products of such residue currents. We prove that, in the case of a complete intersection, the product of the residue currents of a tuple of sections coincides with the residue current of the direct sum of the sections.     

Corrigendum: The complexity of counting graph homomorphisms

We close a gap in the proof of Theorem 4.1 in our paper “The complexity of counting graph homomorphisms” [Random Structures Algorithms 17 (2000), 260–289]. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004     

Algorithm for Optimal Triangulations in Scattered Data Representation and Implementation

Scattered data collected at sample points may be used to determine simple functions to best fit the data. An ideal choice for these simple functions is bivariate splines. Triangulation of the sample points creates partitions over which the bivariate splines may be defined. But the optimality of the approximation is dependent on the choice of triangulation. An algorithm, referred to as an Edge Swapping Algorithm, has been developed to transform an arbitrary triangulation of the sample points into an optimal triangulation for representation of the scattered data. A Matlab package has been completed that implements this algorithm for any triangulation on a given set of sample points.