Characterization of celiac disease related oat proteins: bases for the development of high quality oat varieties suitable for celiac patients

Some studies have suggested that the immunogenicity of oats depends on the cultivar. RP-HPLC has been proposed as a useful technique to select varieties of oats with reduced immunogenicity. The aim of this study was to identify both the avenin protein patterns associated with low gluten content and the available variability for the development of new non-toxic oat cultivars. The peaks of alcohol-soluble avenins of a collection of landraces and cultivars of oats have been characterized based on the RP-HPLC elution times. The immunotoxicity of oat varieties for patients with celiac disease (CD) has been tested using a competitive ELISA based on G12 monoclonal antibody. The oat lines show, on average, seven avenin peaks giving profiles with certain similarities. Based on this similarity, most of the accessions have been grouped into avenin patterns. The variability of RP-HPLC profiles of the collection is great, but not sufficient to uniquely identify the different varieties of the set. Overall, the immunogenicity of the collection is less than 20 ppm. However, there is a different distribution of toxicity ranges between the different peak patterns. We conclude that the RP-HPLC technique is useful to establish groups of varieties differing in degree of toxicity for CD patients.España Ministerio de Economía y Competitividad Project IPT-2011-1321-010000España, Junta de Andalucía Project P12-AGR-176

An algorithm for computing cocyclic matrices developed over some semidirect products

An algorithm for calculating a set ofgenerators ofrepresentative 2-cocycles on semidirect product offinite abelian groups is constructed, in light ofthe theory over cocyclic matrices developed by Horadam and de Launey in [7],[8]. The method involves some homological perturbation techniques [3],[1], in the homological correspondent to the work which Grabmeier and Lambe described in [12] from the viewpoint ofcohomology . Examples ofexplicit computations over all dihedral groups D 4t are given, with aid of Mathematica

Homological models for semidirect products of finitely generated Abelian groups

Let G be a semidirect product of finitely generated Abelian groups. We provide a method for constructing an explicit contraction (special homotopy equivalence) from the reduced bar construction of the group ring of G, B¯¯¯¯(ZZ[G]) , to a much smaller DGA-module hG. Such a contraction is called a homological model for G and is used as the input datum in the methods described in Álvarez et al. (J Symb Comput 44:558–570, 2009; 2012) for calculating a generating set for representative 2-cocycles and n-cocycles over G, respectively. These computations have led to the finding of new cocyclic Hadamard matrices (Álvarez et al. in 2006)

The homological reduction method for computing cocyclic Hadamard matrices

An alternate method for constructing (Hadamard) cocyclic matrices over a finite group GG is described. Provided that a homological model View the MathML sourceB̄(Z[G])ϕ:⇌HFhG for GG is known, the homological reduction method automatically generates a full basis for 2-cocycles over GG (including 2-coboundaries). From these data, either an exhaustive or a heuristic search for Hadamard cocyclic matrices is then developed. The knowledge of an explicit basis for 2-cocycles which includes 2-coboundaries is a key point for the designing of the heuristic search. It is worth noting that some Hadamard cocyclic matrices have been obtained over groups GG for which the exhaustive searching techniques are not feasible. From the computational-cost point of view, even in the case that the calculation of such a homological model is also included, comparison with other methods in the literature shows that the homological reduction method drastically reduces the required computing time of the operations involved, so that even exhaustive searches succeeded at orders for which previous calculations could not be completed. With aid of an implementation of the method in Mathematica, some examples are discussed, including the case of very well-known groups (finite abelian groups, dihedral groups) for clarity

Coupling liquid membrane and flow-injection technique as an analytical strategy for copper analysis in saline water

A tandem system based on the coupling of a bulk liquid membrane and a flow injection analysis for the separation, preconcentration and spectrophotometric determination of copper in saline water is presented. The ligand pyridine-2-acetaldehyde benzoylhydrazone has been used as a carrier in the liquid membrane as well as a spectrophotometric reagent for UV–VIS detection. Simultaneous and sequential experimental designs were used to optimise the chosen variables of each technique, respectively. The metal was separated and preconcentrated from the sample with an efficiency of 100.5 ± 0.9% and a metal preconcentration factor of 16.1. The on-line FIA determination was accomplished after metal complexation by the reagent at pH 3. A linear response was obtained in a range from 6.9 to 984.5 μg L–1 Cu(II), providing a detection limit of 1.8 μg L–1. Saline matrix and other metal ions were not cause of interferences with relative errors below 4.6% for 50 μg L−1 of Cu(II) determination. The proposed tandem system was successfully tested using a TMDA-62 certified reference material providing a relative error of +1.9%; it was also applied to the Cu(II) determination in coastal seawater samples with low relative errors ranging from −3.8% to 0.0% (using DPASV as reference method)

Algebra Structures on the Comparison of the Reduced Bar Construction and the Reduced W-Construction

For a simplicial augmented algebra K, Eilenberg–Mac Lane constructed a chain map . They proved that g is a reduction (homology isomorphism) and conjectured that it is also the injection of a contraction (special homotopy equivalence). The contraction is followed at once by using homological perturbation techniques. If K is commutative, Eilenberg–Mac Lane proved that g is a morphism of DGA-algebras. The present article is devoted to proving that f and φ satisfy certain multiplicative properties (weaker than g) and showing how they can be used for computing in an economical way the homology of twisted cartesian products of two Eilenberg–Mac Lane spaces.Junta de Andalucía FQM–29

Computing “Small” 1–Homological Models for Commutative Differential Graded Algebras

We use homological perturbation machinery specific for the algebra category [13] to give an algorithm for computing the differential structure of a small 1– homological model for commutative differential graded algebras (briefly, CDGAs). The complexity of the procedure is studied and a computer package in Mathematica is described for determining such models.Ministerio de Educación y Ciencia PB98–1621–C02–02Junta de Andalucía FQM–014

On higher dimensional cocyclic Hadamard matrices

Provided that a cohomological model for G is known, we describe a method for constructing a basis for n-cocycles over G, from which the whole set of n-dimensional n-cocyclic matrices over G may be straightforwardly calculated. Focusing in the case n=2 (which is of special interest, e.g. for looking for cocyclic Hadamard matrices), this method provides a basis for 2-cocycles in such a way that representative 2-cocycles are calculated all at once, so that there is no need to distinguish between inflation and transgression 2-cocycles (as it has traditionally been the case until now). When n>2, this method provides an uniform way of looking for higher dimensional n-cocyclic Hadamard matrices for the first time. We illustrate the method with some examples, for n=2,3. In particular, we give some examples of improper 3-dimensional 3-cocyclic Hadamard matrices

Calculating cocyclic hadamard matrices in Mathematica: exhaustive and heuristic searches

We describe a notebook in Mathematica which, taking as input data a homological model for a finite group G of order |G| = 4t, performs an exhaustive search for constructing the whole set of cocyclic Hadamard matrices over G. Since such an exhaustive search is not practical for orders 4t ≥28, the program also provides an alternate method, in which an heuristic search (in terms of a genetic algorithm) is performed. We include some executions and example