The stability and aggregation properties of the GTPase domain from human SEPT4

The septins are a family of conserved proteins involved in cytokinesis and cortical organization. An increasing amount of data implicates different septins in diverse pathological conditions including neurodegenerative disorders, neoplasia and infections. Human SEPT4 is a member of this family and its tissue-specific ectopic expression profile in colorectal and urologic cancer makes it a useful diagnostic biomarker. Thermal unfolding of the GTPase domain of SEPT4 (SEPT4-G) revealed an unfolding intermediate which rapidly aggregates into amyloid-like fibers under physiological conditions. In this study, we examined the effects of protein concentration, pH and metals ions on the aggregation process of recombinant SEPT4-G using a series of biophysical techniques, which were also employed to study chemical unfolding and stability. Divalent metal ions caused significant acceleration to the rate of SEPT4-G aggregation. Urea induced unfolding was shown to proceed via the formation of a partially unfolded intermediate state which unfolds further at higher urea concentrations. The intermediate is a compact dimer which is unable to bind GTR At 1 M urea concentration, the intermediate state was plagued by irreversible aggregation at temperatures above 30 degrees C. However, higher urea concentration resulted in a marked decay of the aggregation, indicating that the partially folded structures may be necessary for the formation of these aggregates. The results presented here are consistent with the recently determined crystal structure of human septins and shed light on the aggregation properties of SEPT4 pertinent to its involvement in neurodegenerative disease. (C) 2008 Elsevier B.V. All rights reserved.

Testing permutation properties through subpermutations

There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this combinatorial structure, by considering only a randomly chosen substructure of sufficiently large, but constant size. These problems are called property testing and parameter testing, where a property or parameter is said to be testable if it can be estimated accurately in this way. The algorithmic appeal is evident, as, conditional on sampling, this leads to reliable constant-time randomized estimators. Our paper addresses property testing and parameter testing for permutations in a subpermutation perspective; more precisely, we investigate permutation properties and parameters that can be well approximated based on a randomly chosen subpermutation of much smaller size. In this context, we use a theory of convergence of permutation sequences developed by the present authors [C. Hoppen, Y. Kohayakawa, C.G. Moreira, R.M. Sampaio, Limits of permutation sequences through permutation regularity, Manuscript, 2010, 34pp.] to characterize testable permutation parameters along the lines of the work of Borgs et al. [C. Borgs, J. Chayes, L Lovasz, V.T. Sos, B. Szegedy, K. Vesztergombi, Graph limits and parameter testing, in: STOC`06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, ACM, New York, 2006, pp. 261-270.] in the case of graphs. Moreover, we obtain a permutation result in the direction of a famous result of Alon and Shapira [N. Alon, A. Shapira, A characterization of the (natural) graph properties testable with one-sided error, SIAM J. Comput. 37 (6) (2008) 1703-1727.] stating that every hereditary graph property is testable. (C) 2011 Elsevier B.V. All rights reserved.