The intracellular Ig fold: a robust protein scaffold for the engineering of molecular recognition

Protein scaffolds that support molecular recognition have multiple applications in biotechnology. Thus, protein frames with robust structural cores but adaptable surface loops are in continued demand. Recently, notable progress has been made in the characterization of Ig domains of intracellular origin--in particular, modular components of the titin myofilament. These Ig belong to the I(intermediate)-type, are remarkably stable, highly soluble and undemanding to produce in the cytoplasm of Escherichia coli. Using the Z1 domain from titin as representative, we show that the I-Ig fold tolerates the drastic diversification of its CD loop, constituting an effective peptide display system. We examine the stability of CD-loop-grafted Z1-peptide chimeras using differential scanning fluorimetry, Fourier transform infrared spectroscopy and nuclear magnetic resonance and demonstrate that the introduction of bioreactive affinity binders in this position does not compromise the structural integrity of the domain. Further, the binding efficiency of the exogenous peptide sequences in Z1 is analyzed using pull-down assays and isothermal titration calorimetry. We show that an internally grafted, affinity FLAG tag is functional within the context of the fold, interacting with the anti-FLAG M2 antibody in solution and in affinity gel. Together, these data reveal the potential of the intracellular Ig scaffold for targeted functionalization.

Distinctive Convergence in Australian Floral Colours Seen Through the Eyes of Australian Birds

We used a colour-space model of avian vision to assess whether a distinctive bird pollination syndrome exists for floral colour among Australian angiosperms. We also used a novel phylogenetically based method to assess whether such a syndrome represents a significant degree of convergent evolution. About half of the 80 species in our sample that attract nectarivorous birds had floral colours in a small, isolated region of colour space characterized by an emphasis on long-wavelength reflection. The distinctiveness of this 'red arm' region was much greater when colours were modelled for violet-sensitive (VS) avian vision than for the ultraviolet-sensitive visual system. Honeyeaters (Meliphagidae) are the dominant avian nectarivores in Australia and have VS vision. Ancestral state reconstructions suggest that 31 lineages evolved into the red arm region, whereas simulations indicate that an average of five or six lineages and a maximum of 22 are likely to have entered in the absence of selection. Thus, significant evolutionary convergence on a distinctive floral colour syndrome for bird pollination has occurred in Australia, although only a subset of bird-pollinated taxa belongs to this syndrome. The visual system of honeyeaters has been the apparent driver of this convergence.

Efficient Liquid Liquid Extraction By Emulsion Formation and Separation in Robust Milli-Fluidic Devices

Conventional liquid liquid extraction (LLE) methods require large volumes of fluids to achieve the desired mass transfer of a solute, which is unsuitable for systems dealing with a low volume or high value product. An alternative to these methods is to scale down the process. Millifluidic devices share many of the benefits of microfluidic systems, including low fluid volumes, increased interfacial area-to-volume ratio, and predictability. A robust millifluidic device was created from acrylic, glass, and aluminum. The channel is lined with a hydrogel cured in the bottom half of the device channel. This hydrogel stabilizes co-current laminar flow of immiscible organic and aqueous phases. Mass transfer of the solute occurs across the interface of these contacting phases. Using a y-junction, an aqueous emulsion is created in an organic phase. The emulsion travels through a length of tubing and then enters the co-current laminar flow device, where the emulsion is broken and each phase can be collected separately. The inclusion of this emulsion formation and separation increases the contact area between the organic and aqueous phases, therefore increasing the area over which mass transfer can occur. Using this design, 95% extraction efficiency was obtained, where 100% is represented by equilibrium. By continuing to explore this LLE process, the process can be optimized and with better understanding may be more accurately modeled. This system has the potential to scale up to the industrial level and provide the efficient extraction required with low fluid volumes and a well-behaved system.

P-Technique Factor Analyses of the Multiple Affect Adjective Checklist (MAACL)

The Multiple Affect Adjective Check List (MAACL) has been found to have five first-order factors representing Anxiety, Depression, Hostility, Positive Affect, and Sensation Seeking and two second-order factors representing Positive Affect and Sensation Seeking (PASS) and Dysphoria. The present study examines whether these first- and second-order conceptions of affect (based on R-technique factor analysis) can also account for patterns of intraindividual variability in affect (based on P-technique factor analysis) in eight elderly women. Although the hypothesized five-factor model of affect was not testable in all of the present P-technique datasets, the results were consistent with this interindividual model of affect. Moreover, evidence of second-order (PASS and Dysphoria) and third-order (generalized distress) factors was found in one data set. Sufficient convergence in findings between the present P-technique research and prior R-technique research suggests that the MAACL is robust in describing both inter- and intraindividual components of affect in elderly women.

A Robust Parser of Czech

Mr. Kubon's project was inspired by the growing need for an automatic, syntactic analyser (parser) of Czech, which could be used in the syntactic processing of large amounts of texts. Mr. Kubon notes that such a tool would be very useful, especially in the field of corpus linguistics, where creating a large-scale "tree bank" (a collection of syntactic representations of natural language sentences) is a very important step towards the investigation of the properties of a given language. The work involved in syntactically parsing a whole corpus in order to get a representative set of syntactic structures would be almost inconceivable without the help of some kind of robust (semi)automatic parser. The need for the automatic natural language parser to be robust increases with the size of the linguistic data in the corpus or in any other kind of text which is going to be parsed. Practical experience shows that apart from syntactically correct sentences, there are many sentences which contain a "real" grammatical error. These sentences may be corrected in small-scale texts, but not generally in the whole corpus. In order to be able to complete the overall project, it was necessary to address a number of smaller problems. These were; 1. the adaptation of a suitable formalism able to describe the formal grammar of the system; 2. the definition of the structure of the system's dictionary containing all relevant lexico-syntactic information, and the development of a formal grammar able to robustly parse Czech sentences from the test suite; 3. filling the syntactic dictionary with sample data allowing the system to be tested and debugged during its development (about 1000 words); 4. the development of a set of sample sentences containing a reasonable amount of grammatical and ungrammatical phenomena covering some of the most typical syntactic constructions being used in Czech. Number 3, building a formal grammar, was the main task of the project. The grammar is of course far from complete (Mr. Kubon notes that it is debatable whether any formal grammar describing a natural language may ever be complete), but it covers the most frequent syntactic phenomena, allowing for the representation of a syntactic structure of simple clauses and also the structure of certain types of complex sentences. The stress was not so much on building a wide coverage grammar, but on the description and demonstration of a method. This method uses a similar approach as that of grammar-based grammar checking. The problem of reconstructing the "correct" form of the syntactic representation of a sentence is closely related to the problem of localisation and identification of syntactic errors. Without a precise knowledge of the nature and location of syntactic errors it is not possible to build a reliable estimation of a "correct" syntactic tree. The incremental way of building the grammar used in this project is also an important methodological issue. Experience from previous projects showed that building a grammar by creating a huge block of metarules is more complicated than the incremental method, which begins with the metarules covering most common syntactic phenomena first, and adds less important ones later, especially from the point of view of testing and debugging the grammar. The sample of the syntactic dictionary containing lexico-syntactical information (task 4) now has slightly more than 1000 lexical items representing all classes of words. During the creation of the dictionary it turned out that the task of assigning complete and correct lexico-syntactic information to verbs is a very complicated and time-consuming process which would itself be worth a separate project. The final task undertaken in this project was the development of a method allowing effective testing and debugging of the grammar during the process of its development. The problem of the consistency of new and modified rules of the formal grammar with the rules already existing is one of the crucial problems of every project aiming at the development of a large-scale formal grammar of a natural language. This method allows for the detection of any discrepancy or inconsistency of the grammar with respect to a test-bed of sentences containing all syntactic phenomena covered by the grammar. This is not only the first robust parser of Czech, but also one of the first robust parsers of a Slavic language. Since Slavic languages display a wide range of common features, it is reasonable to claim that this system may serve as a pattern for similar systems in other languages. To transfer the system into any other language it is only necessary to revise the grammar and to change the data contained in the dictionary (but not necessarily the structure of primary lexico-syntactic information). The formalism and methods used in this project can be used in other Slavic languages without substantial changes.

Adaptation to hard-object feeding in sea otters and hominins

The large, bunodont postcanine teeth in living sea otters (Enhydra lutris) have been likened to those of certain fossil hominins, particularly the ’robust’ australopiths (genus Paranthropus). We examine this evolutionary convergence by conducting fracture experiments on extracted molar teeth of sea otters and modern humans (Homo sapiens) to determine how load-bearing capacity relates to tooth morphology and enamel material properties. In situ optical microscopy and x-ray imaging during simulated occlusal loading reveal the nature of the fracture patterns. Explicit fracture relations are used to analyze the data and to extrapolate the results from humans to earlier hominins. It is shown that the molar teeth of sea otters have considerably thinner enamel than those of humans, making sea otter molars more susceptible to certain kinds of fractures. At the same time, the base diameter of sea otter first molars is larger, diminishing the fracture susceptibility in a compensatory manner. We also conduct nanoindentation tests to map out elastic modulus and hardness of sea otter and human molars through a section thickness, and microindentation tests to measure toughness. We find that while sea otter enamel is just as stiff elastically as human enamel, it is a little softer and tougher. The role of these material factors in the capacity of dentition to resist fracture and deformation is considered. From such comparisons, we argue that early hominin species like Paranthropus most likely consumed hard food objects with substantially higher biting forces than those exerted by modern humans.

Squared Extrapolation Methods (SQUAREM): A New Class of Simple and Efficient Numerical Schemes for Accelerating the Convergence of the EM Algorithm

We derive a new class of iterative schemes for accelerating the convergence of the EM algorithm, by exploiting the connection between fixed point iterations and extrapolation methods. First, we present a general formulation of one-step iterative schemes, which are obtained by cycling with the extrapolation methods. We, then square the one-step schemes to obtain the new class of methods, which we call SQUAREM. Squaring a one-step iterative scheme is simply applying it twice within each cycle of the extrapolation method. Here we focus on the first order or rank-one extrapolation methods for two reasons, (1) simplicity, and (2) computational efficiency. In particular, we study two first order extrapolation methods, the reduced rank extrapolation (RRE1) and minimal polynomial extrapolation (MPE1). The convergence of the new schemes, both one-step and squared, is non-monotonic with respect to the residual norm. The first order one-step and SQUAREM schemes are linearly convergent, like the EM algorithm but they have a faster rate of convergence. We demonstrate, through five different examples, the effectiveness of the first order SQUAREM schemes, SqRRE1 and SqMPE1, in accelerating the EM algorithm. The SQUAREM schemes are also shown to be vastly superior to their one-step counterparts, RRE1 and MPE1, in terms of computational efficiency. The proposed extrapolation schemes can fail due to the numerical problems of stagnation and near breakdown. We have developed a new hybrid iterative scheme that combines the RRE1 and MPE1 schemes in such a manner that it overcomes both stagnation and near breakdown. The squared first order hybrid scheme, SqHyb1, emerges as the iterative scheme of choice based on our numerical experiments. It combines the fast convergence of the SqMPE1, while avoiding near breakdowns, with the stability of SqRRE1, while avoiding stagnations. The SQUAREM methods can be incorporated very easily into an existing EM algorithm. They only require the basic EM step for their implementation and do not require any other auxiliary quantities such as the complete data log likelihood, and its gradient or hessian. They are an attractive option in problems with a very large number of parameters, and in problems where the statistical model is complex, the EM algorithm is slow and each EM step is computationally demanding.