Designing antibiotic cycling strategies by determining and understanding local adaptive landscapes.

The evolution of antibiotic resistance among bacteria threatens our continued ability to treat infectious diseases. The need for sustainable strategies to cure bacterial infections has never been greater. So far, all attempts to restore susceptibility after resistance has arisen have been unsuccessful, including restrictions on prescribing [1] and antibiotic cycling [2], [3]. Part of the problem may be that those efforts have implemented different classes of unrelated antibiotics, and relied on removal of resistance by random loss of resistance genes from bacterial populations (drift). Here, we show that alternating structurally similar antibiotics can restore susceptibility to antibiotics after resistance has evolved. We found that the resistance phenotypes conferred by variant alleles of the resistance gene encoding the TEM ß-lactamase (bla(TEM)) varied greatly among 15 different ß-lactam antibiotics. We captured those differences by characterizing complete adaptive landscapes for the resistance alleles bla(TEM-50) and bla(TEM-85), each of which differs from its ancestor bla(TEM-1) by four mutations. We identified pathways through those landscapes where selection for increased resistance moved in a repeating cycle among a limited set of alleles as antibiotics were alternated. Our results showed that susceptibility to antibiotics can be sustainably renewed by cycling structurally similar antibiotics. We anticipate that these results may provide a conceptual framework for managing antibiotic resistance. This approach may also guide sustainable cycling of the drugs used to treat malaria and HIV.

Analyzing locomotion synthesis with feature-based motion graphs.

We propose feature-based motion graphs for realistic locomotion synthesis among obstacles. Among several advantages, feature-based motion graphs achieve improved results in search queries, eliminate the need of postprocessing for foot skating removal, and reduce the computational requirements in comparison to traditional motion graphs. Our contributions are threefold. First, we show that choosing transitions based on relevant features significantly reduces graph construction time and leads to improved search performances. Second, we employ a fast channel search method that confines the motion graph search to a free channel with guaranteed clearance among obstacles, achieving faster and improved results that avoid expensive collision checking. Lastly, we present a motion deformation model based on Inverse Kinematics applied over the transitions of a solution branch. Each transition is assigned a continuous deformation range that does not exceed the original transition cost threshold specified by the user for the graph construction. The obtained deformation improves the reachability of the feature-based motion graph and in turn also reduces the time spent during search. The results obtained by the proposed methods are evaluated and quantified, and they demonstrate significant improvements in comparison to traditional motion graph techniques.