Source and Description of Primers. Primers were designed from published sheep epidermal growth factor ( EGF) sequence (GenBank accession no. U36428) and were used to amplify across intron 3 of the EGF gene from porcine genomic DNA. Of sequences produced, 84 bp showed 82.1% identity to sheep EGF exon 3 and 81.0% to human EFG exon 3. For exon 4, the 75 bp showed 82.3% identity to sheep EGF exon 4...

We prove a result on the length of a longest cycle in a graph on n vertices that contains a 2-factor and satisfies d(u)+ d(v)+d(w)~> n + 2 for every triple u, v, w of independent vertices. As a corollary we obtain the following improvement of a conjecture of H/iggkvist (1992): Let G be a 2-connected graph on n vertices where every pair of nonadjacent vertices has degree sum at least n-k and ass...

using the mixed solvents, (water +ethanol + propanol), the solubility of cdf2 was determined byevaporating method at 25° c. the results showed that the sollbility, s, of cdf2 decreases bydecreasing the dielectric constant of the mixed solvent .once the solubility of cdf2 was determined,the concentration solubility product, ksp(c)=4s3, was calculated .furthermore ,by estimating the meanactivity ...

An incremental, nonparametric probability estimation procedure using a variation of the Fuzzy ARTMAP (FAM) neural network is introduced. The resulted network, called Fuzzy ARTMAP with Relevance factor (FAMR), uses a relevance factor assigned to each sample pair, proportional to the importance of that pair during the learning phase. We prove that our probability estimator is correct. The FAMR ca...

FAMR (Fuzzy ARTMAP with Relevance factor) is a FAM (Fuzzy ARTMAP) neural network used for classification, probability estimation [3], [2], and function approximation [4]. FAMR uses a relevance factor assigned to each sample pair, proportional to the importance of that pair during the learning phase. Due to its incremental learning capability, FAMR can efficiently process large data sets and is ...

We study the complexity of the problem Detection Pair. A detection pair of a graph G is a pair (W,L) of sets of detectors with W ⊆ V (G), the watchers, and L ⊆ V (G), the listeners, such that for every pair u, v of vertices that are not dominated by a watcher of W , there is a listener of L whose distances to u and to v are different. The goal is to minimize |W |+ |L|. This problem generalizes ...

An analysis of the human chromosome 22 genomic sequence shows that both Z-DNA forming regions (ZDRs) and promoter sites for nuclear factor-I (NFI) are correlated with the locations of known and predicted genes across the chromosome and accumulate around the transcriptional start sites of the known genes. Thus, the occurrence of Z-DNA across human genomic sequences mirrors that of a known eukary...