Phase portraits of quadratic polynomial vector fields having a rational first integral of degree 3

In this paper, we classify all the global phase portraits of the quadratic polynomial vector fields having a rational first integral of degree 3. (C) 2008 Elsevier Ltd. All rights reserved.

From Rational Design of Drug Crystals to Understanding of Nucleic Acid Structures: Lamivudine Duplex

A DNA-like duplex of nucleosides is probable to exist even without the 5`-phosphate groups needed to assemble the chain backbone. However, double-stranded helical structures of nucleosides are unknown. Here, we report a duplex of nucleoside analogs that is spontaneously assembled due to stacking of the neutral and protonated molecules of lamivudine, a nucleoside reverse transcriptase inhibitor (NTRI) widely used in anti-HIV drug combinatory medication. The left-handed lamivudine duplex has features similar to those of i-motif DNA, as the face-to-face base stacking and the helix rise per base pair. Furthermore, the protonation pattern on alternate bases expected for it DNA-like duplex stabilized by pairing of neutral and protonated cytosine fragments was observed for the first time in the lamivudine double-stranded helix. This structure demonstrates that hydrogen bonds can substitute for covalent phosphodiester linkage in the stabilization of the duplex backbone. This interesting example of spontaneous molecular self-organization indicates that the 5`-phosphate group could not be a requirement for duplex assembly.

Approximating a class of combinatorial problems with rational objective function

In the late seventies, Megiddo proposed a way to use an algorithm for the problem of minimizing a linear function a(0) + a(1)x(1) + ... + a(n)x(n) subject to certain constraints to solve the problem of minimizing a rational function of the form (a(0) + a(1)x(1) + ... + a(n)x(n))/(b(0) + b(1)x(1) + ... + b(n)x(n)) subject to the same set of constraints, assuming that the denominator is always positive. Using a rather strong assumption, Hashizume et al. extended Megiddo`s result to include approximation algorithms. Their assumption essentially asks for the existence of good approximation algorithms for optimization problems with possibly negative coefficients in the (linear) objective function, which is rather unusual for most combinatorial problems. In this paper, we present an alternative extension of Megiddo`s result for approximations that avoids this issue and applies to a large class of optimization problems. Specifically, we show that, if there is an alpha-approximation for the problem of minimizing a nonnegative linear function subject to constraints satisfying a certain increasing property then there is an alpha-approximation (1 1/alpha-approximation) for the problem of minimizing (maximizing) a nonnegative rational function subject to the same constraints. Our framework applies to covering problems and network design problems, among others.