Absence of branches from xylan in Arabidopsis gux mutants reveals potential for simplification of lignocellulosic biomass.

As one of the most abundant polysaccharides on Earth, xylan will provide more than a third of the sugars for lignocellulosic biofuel production when using grass or hardwood feedstocks. Xylan is characterized by a linear β(1,4)-linked backbone of xylosyl residues substituted by glucuronic acid, 4-O-methylglucuronic acid or arabinose, depending on plant species and cell types. The biological role of these decorations is unclear, but they have a major influence on the properties of the polysaccharide. Despite the recent isolation of several mutants with reduced backbone, the mechanisms of xylan synthesis and substitution are unclear. We identified two Golgi-localized putative glycosyltransferases, GlucUronic acid substitution of Xylan (GUX)-1 and GUX2 that are required for the addition of both glucuronic acid and 4-O-methylglucuronic acid branches to xylan in Arabidopsis stem cell walls. The gux1 gux2 double mutants show loss of xylan glucuronyltransferase activity and lack almost all detectable xylan substitution. Unexpectedly, they show no change in xylan backbone quantity, indicating that backbone synthesis and substitution can be uncoupled. Although the stems are weakened, the xylem vessels are not collapsed, and the plants grow to normal size. The xylan in these plants shows improved extractability from the cell wall, is composed of a single monosaccharide, and requires fewer enzymes for complete hydrolysis. These findings have implications for our understanding of the synthesis and function of xylan in plants. The results also demonstrate the potential for manipulating and simplifying the structure of xylan to improve the properties of lignocellulose for bioenergy and other uses.

Consensus optimization on manifolds

The present paper considers distributed consensus algorithms that involve N agents evolving on a connected compact homogeneous manifold. The agents track no external reference and communicate their relative state according to a communication graph. The consensus problem is formulated in terms of the extrema of a cost function. This leads to efficient gradient algorithms to synchronize (i.e., maximizing the consensus) or balance (i.e., minimizing the consensus) the agents; a convenient adaptation of the gradient algorithms is used when the communication graph is directed and time-varying. The cost function is linked to a specific centroid definition on manifolds, introduced here as the induced arithmetic mean, that is easily computable in closed form and may be of independent interest for a number of manifolds. The special orthogonal group SO (n) and the Grassmann manifold Grass (p, n) are treated as original examples. A link is also drawn with the many existing results on the circle. © 2009 Society for Industrial and Applied Mathematics.