Within the frame of a biotechnological screening, we isolated two Pseudomonas strains from forest soil. 16S rRNA gene sequence analysis indicated that strain CCOS 864T shared 99.8 % similarity with Pseudomonas donghuensis HYST, while strain CCOS 865T shared 99.0 % similarity with Pseudomonas putida DSM 291T and lower similarity with other P. putida group type strains. Based on multilocus sequence analysis, the two strains were genotypically distinct from each other, each forming a separate clade. Strains CCOS 864T and CCOS 865T were Gram-stain-negative, motile and rod-shaped, growing at a temperature range of 4-37 °C. Strain CCOS 864T could be phenotypically distinguished from P. putida group species by the combination of gelatinase-positive reaction and positive growth on N-acetyl-d-glucosamine, p-hydroxyphenylacetic acid and inosine but lack of fluorescein production on King's B medium, while strain CCOS 865T could be distinguished from P. putida group species by the combination of positive growth with saccharic acid and negative growth with p-hydroxyphenylacetic acid and l-pyroglutamic acid. The major polar lipid for both strains was phosphatidylethanolamine; the major quinone was ubiquinone Q-9. DNA-DNA hybridization and average nucleotide identities confirmed the novel species status for the two strains. The DNA G+C contents of CCOS 864T and CCOS 865T were 62.1 and 63.8 mol%, respectively. The phenotypic, phylogenetic and DNA-DNA relatedness data support the suggestion that CCOS 864T and CCOS 865T represent two novel Pseudomonas species. The names Pseudomonas wadenswilerensis sp. nov. (type strain CCOS 864T=LMG 29327T) and Pseudomonas reidholzensis sp. nov. (type strain CCOS 865T=LMG 29328T) are proposed.

This paper presents NFO, a new and innovative technique for collision resolution based on single dimensional arrays. Hash collisions are practically unavoidable when hashing a random subset of a large set of possible keys and should be seen as an event that can disrupt the normal operations or flow of hash functions computing an index into an array of buckets or slots. Hash tables provide efficient table implementations but then its performance is greatly affected if there are high loads of collisions. This new approach intends to manage these collisions effectively and properly although there are some algorithms for handling collisions currently. NFO incorporates certain features to resolve some problems of existing techniques. The performance of our approach is quantified via analytical modeling and software simulations. Efficient implementations that are easily realizable and productive in modern technologies are discussed. The performance benefits are significant and require machines with moderate memory and speed specifications. Depending on observations of the results of implementation of the proposed approach or technique on a set of real data of several types, all results are registered and analyzed.

No abstract

No abstract

No abstract