Analysis of the elements of catabolite repression in Clostridium acetobutylicum.

The ptsH gene, encoding the phosphotransferase protein HPr, from Clostridium acetobutylicum ATCC 824 was identified from the genome sequence, cloned and shown to complement a ptsH mutant of Escherichia coli. The deduced protein sequence shares significant homology with HPr proteins from other low-GC gram-positive bacteria, although the highly conserved sequence surrounding the Ser-46 phosphorylation site is not well preserved in the clostridial protein. Nevertheless, the HPr was phosphorylated in an ATP-dependent manner in cell-free extracts of C. acetobutylicum. Furthermore, purified His-tagged HPr from Bacillus subtilis was also a substrate for the clostridial HPr kinase/phosphorylase. This phosphorylation reaction is a key step in the mechanism of carbon catabolite repression proposed to operate in B. subtilis and other low-GC gram-positive bacteria. Putative genes encoding the HPr kinase/phosphorylase and the other element of this model, namely the catabolite control protein CcpA, were identified from the C. acetobutylicum genome sequence, suggesting that a similar mechanism of carbon catabolite repression may operate in this industrially important organism.

Time-dependent Hyperstar algorithm for robust vehicle navigation in time-dependent stochastic road networks.

The vehicle navigation problem studied in Bell (2009) is revisited and a time-dependent reverse Hyperstar algorithm is presented. This minimises the expected time of arrival at the destination, and all intermediate nodes, where expectation is based on a pessimistic (or risk-averse) view of unknown link delays. This may also be regarded as a hyperpath version of the Chabini and Lan (2002) algorithm, which itself is a time-dependent A* algorithm. Links are assigned undelayed travel times and maximum delays, both of which are potentially functions of the time of arrival at the respective link. The driver seeks probabilities for link use that minimise his/her maximum exposure to delay on the approach to each node, leading to the determination of the pessimistic expected time of arrival. Since the context considered is vehicle navigation where the driver is not making repeated trips, the probability of link use may be interpreted as a measure of link attractiveness, so a link with a zero probability of use is unattractive while a link with a probability of use equal to one will have no attractive alternatives. A solution algorithm is presented and proven to solve the problem provided the node potentials are feasible and a FIFO condition applies for undelayed link travel times. The paper concludes with a numerical example.