HLA-B*57 and Gender Influence the Occurrence of Tuberculosis in HIV Infected People of South India

Background. Substantial evidence exists for HLA and other host genetic factors being determinants of susceptibility or resistance to infectious diseases. However, very little information is available on the role of host genetic factors in HIV-TB coinfection. Hence, a longitudinal study was undertaken to investigate HLA associations in a cohort of HIV seropositive individuals with and without TB in Bangalore, South India. Methods. A cohort of 238 HIV seropositive subjects were typed for HLA-A, B, and DR by PCR-SSP and followed up for 5 years or till manifestation of Tuberculosis. HLA data of 682 HIV Negative healthy renal donors was used as control. Results. The ratio of males and females in HIV cohort was comparable (50.4% and 49.6%). But the incidence of TB was markedly lower in females (12.6%,) than males (25.6%). Further, HLA-B* 57 frequency in HIV cohort was significantly higher among females without TB (21.6%, 19/88) than males (1.7%, 1/59); P = 0.0046; OR = 38. CD4 counts also were higher among females in this cohort. Conclusion. This study suggests that HIV positive women with HLA-B* 57 have less occurrence of TB as compared to males.

Cubic Sieve Congruence of the Discrete Logarithm Problem, and fractional part sequences

The Cubic Sieve Method for solving the Discrete Logarithm Problem in prime fields requires a nontrivial solution to the Cubic Sieve Congruence (CSC) x(3) equivalent to y(2)z (mod p), where p is a given prime number. A nontrivial solution must also satisfy x(3) not equal y(2)z and 1 <= x, y, z < p(alpha), where alpha is a given real number such that 1/3 < alpha <= 1/2. The CSC problem is to find an efficient algorithm to obtain a nontrivial solution to CSC. CSC can be parametrized as x equivalent to v(2)z (mod p) and y equivalent to v(3)z (mod p). In this paper, we give a deterministic polynomial-time (O(ln(3) p) bit-operations) algorithm to determine, for a given v, a nontrivial solution to CSC, if one exists. Previously it took (O) over tilde (p(alpha)) time in the worst case to determine this. We relate the CSC problem to the gap problem of fractional part sequences, where we need to determine the non-negative integers N satisfying the fractional part inequality {theta N} < phi (theta and phi are given real numbers). The correspondence between the CSC problem and the gap problem is that determining the parameter z in the former problem corresponds to determining N in the latter problem. We also show in the alpha = 1/2 case of CSC that for a certain class of primes the CSC problem can be solved deterministically in <(O)over tilde>(p(1/3)) time compared to the previous best of (O) over tilde (p(1/2)). It is empirically observed that about one out of three primes is covered by the above class. (C) 2013 Elsevier B.V. All rights reserved.