Repeatability and Biofidelity of a Physical Surrogate Neck Model Fit to a Hybrid III Head.

In helmet impact testing, parameters including acceleration and velocity are measured using instrumented head-neck models that are meant to be mechanically realistic (i.e. biofidelic) stand-ins, or surrogates, for humans. Currently available models of the human neck are designed primarily for application in automotive crash testing, and their applicability in assessment of helmets is often questioned. The object of the present work is to document the mechanical design, repeatability, and biofidelity in low speed impact of a new neck model that we apply with a Hybrid III head. Focusing on Hybrid III head kinematics measured during impacts at 2 to 6 m/s, the co-efficient of variance of repeated measures of kinematics was generally less than 10%. Differences in kinematics between identical copies of the neck was less than 20% when tested with helmets, and less than 7% when the head was not helmeted. In parallel testing using a Hybrid III head-neck, the co-efficient of variance in repeated measures was less than 4% and the kinematics significantly differed from those measured using the new neck. CORAplus scores for the new neck were approximately 0.70 when compared against data for human subjects with passive neck muscles experiencing impact at 2 m/s.

Phylosymmetric Algebras: Mathematical Properties of a New Tool in Phylogenetics.

In phylogenetics, it is of interest for rate matrix sets to satisfy closure under matrix multiplication as this makes finding the set of corresponding transition matrices possible without having to compute matrix exponentials. It is also advantageous to have a small number of free parameters as this, in applications, will result in a reduction in computation time. We explore a method of building a rate matrix set from a rooted tree structure by assigning rates to internal tree nodes and states to the leaves, then defining the rate of change between two states as the rate assigned to the most recent common ancestor of those two states. We investigate the properties of these matrix sets from both a linear algebra and a graph theory perspective and show that any rate matrix set generated this way is closed under matrix multiplication. The consequences of setting two rates assigned to internal tree nodes to be equal are then considered. This methodology could be used to develop parameterised models of amino acid substitution which have a small number of parameters but convey biological meaning.

The impracticalities of multiplicatively-closed codon models: a retreat to linear alternatives.

A matrix Lie algebra is a linear space of matrices closed under the operation [Formula: see text]. The "Lie closure" of a set of matrices is the smallest matrix Lie algebra which contains the set. In the context of Markov chain theory, if a set of rate matrices form a Lie algebra, their corresponding Markov matrices are closed under matrix multiplication; this has been found to be a useful property in phylogenetics. Inspired by previous research involving Lie closures of DNA models, it was hypothesised that finding the Lie closure of a codon model could help to solve the problem of mis-estimation of the non-synonymous/synonymous rate ratio, [Formula: see text]. We propose two different methods of finding a linear space from a model: the first is the linear closure which is the smallest linear space which contains the model, and the second is the linear version which changes multiplicative constraints in the model to additive ones. For each of these linear spaces we then find the Lie closures of them. Under both methods, it was found that closed codon models would require thousands of parameters, and that any partial solution to this problem that was of a reasonable size violated stochasticity. Investigation of toy models indicated that finding the Lie closure of matrix linear spaces which deviated only slightly from a simple model resulted in a Lie closure that was close to having the maximum number of parameters possible. Given that Lie closures are not practical, we propose further consideration of the two variants of linearly closed models.

The Ancient Operational Code is Embedded in the Amino Acid Substitution Matrix and aaRS Phylogenies.

The underlying structure of the canonical amino acid substitution matrix (aaSM) is examined by considering stepwise improvements in the differential recognition of amino acids according to their chemical properties during the branching history of the two aminoacyl-tRNA synthetase (aaRS) superfamilies. The evolutionary expansion of the genetic code is described by a simple parameterization of the aaSM, in which (i) the number of distinguishable amino acid types, (ii) the matrix dimension and (iii) the number of parameters, each increases by one for each bifurcation in an aaRS phylogeny. Parameterized matrices corresponding to trees in which the size of an amino acid sidechain is the only discernible property behind its categorization as a substrate, exclusively for a Class I or II aaRS, provide a significantly better fit to empirically determined aaSM than trees with random bifurcation patterns. A second split between polar and nonpolar amino acids in each Class effects a vastly greater further improvement. The earliest Class-separated epochs in the phylogenies of the aaRS reflect these enzymes' capability to distinguish tRNAs through the recognition of acceptor stem identity elements via the minor (Class I) and major (Class II) helical grooves, which is how the ancient operational code functioned. The advent of tRNA recognition using the anticodon loop supports the evolution of the optimal map of amino acid chemistry found in the later genetic code, an essentially digital categorization, in which polarity is the major functional property, compensating for the unrefined, haphazard differentiation of amino acids achieved by the operational code.