In this paper we study the distribution of pairs (d1, d2) of positive integers such that the product d1d2 divides a given integer n from a probabilistic point of view. The number of these pairs, denoted by τ3(n), is equal to the number of ways to write n as a product of three positive integers. To these pairs we associate a random vector taking the values ( (log d1)/(log n), (log d2)/(log n) ) ...

POU1F1 is a positive regulator for GH, PRL and TSHβ and its mutations associate with production traits in ruminant animals. We described a DdeI PCR-RFLP method for detecting a silent allele in the goat POU1F1 gene: TCT (241Ser)>TCG (241Ser). Frequencies of D1 allele varied from 0.600 to 1.000 in Chinese 801 goats. Significant associations of DdeI polymorphism with production traits were found i...

We have determined the 3.0 A crystal structure of the three C-terminal domains 3-5 (D3-D5) of ICAM-1. Combined with the previously known N-terminal two-domain structure (D1D2), a model of an entire ICAM-1 extracellular fragment has been constructed. This model should represent a general architecture of other ICAM family members, particularly ICAM-3 and ICAM-5. The observed intimate dimerization...

PRO 542 (CD4-IgG2) is a recombinant antibody-like fusion protein wherein the Fv portions of both the heavy and light chains of human IgG2 have been replaced with the D1D2 domains of human CD4. Unlike monovalent and divalent CD4-based proteins, tetravalent PRO 542 potently neutralizes diverse primary human immunodeficiency virus (HIV) type 1 isolates. In this phase 1 study, the first evaluation ...

Soybeans (Glycine max (L.) Merr.) with black seed coats and green cotyledons are rich in anthocyanins chlorophylls known as functional nutrients, antioxidants compounds anticarcinogenic properties. Understanding the genetic diversity of germplasm is important to determine effective strategies for improving economic traits these soybeans. We aimed analyze 470 soybean accessions by 6K single nucl...

This paper is concernedwith the analysis of theworst case behavior of Hopcroft’s algorithm for minimizing deterministic finite state automata. We extend a result of Castiglione, Restivo and Sciortino. They show that Hopcroft’s algorithm has a worst case behavior for the automata recognizing Fibonacci words. In a previous paper, we have proved that this holds for all standard Sturmian words havi...