ABSTRACT. The ectoparasitic bee mite, Varroa destructor, is highly adapted to its natural and adopted honey bee hosts, Apis cerana and Apis mellifera. Adult females perforate the integument of bee pupae in such a way that they and their progeny can feed. We examined the wounds that founder females made, and usually found one, and rarely up to three, integumental wounds on pupae of A. mellifera multiply infested by V. destructor. The punctures were mainly on the 2nd abdominal sternite of the host. These perforations are used repeatedly as feeding sites by these hemolymph-sucking mites and by their progeny. The diameter of the wounds increased during pupal development. In brood cells containing 4-5 invading female mites and their progeny, healing of the wound is delayed, normally occurring just before the imaginal moult of the bee pupa. These wounds are subject to microbial infections, and they are relevant to the evolution of behavioral traits in these parasitic mites and their relations to host bees.

ABSTRACT. We used light and transmission electron microscopy to examine the morphology of the accessory glands of immature and mature adult males of Apis mellifera L. We also made an electrophoretic analysis of the protein content of the mature gland. The glands of the immature male actively secrete a mucous substance that can be seen in the lumen of the gland of the mature male. This secretion stains with mercury bromophenol blue and with periodic acid-Schiff reaction, which stain glyconjugates. The protein content was higher in the lumen secretion than in the gland wall extracts. The electrophoresis patterns of the wall extracts were different from those of the secretion found in the gland lumen.

ABSTRACT. Data on productive and reproductive performance of cows in dual-purpose herds were analyzed to determine the effect of some environmental and genetic factors on saleable milk yield (SMY), lactation length (LL), daily saleable milk per lactation (DMYL), calving interval (CI), and daily saleable milk per calving interval (MYCI) in dual-purpose herds in Yucatan, Mexico. Repeatabilities (r_e) for these traits were also estimated. Data were obtained from monthly visits to 162 herds from 1996 to 2000. The fixed factors studied were: region (central, eastern and southern), parity number (1 to 6), calving year (1996 to 2000) and calving season (dry, rainy and windy and rainy), genetic group (low- (<0.50%), medium- (50%) and high- (>50%) grade cows with European genes). About 2700 to 7700 cows were evaluated for each trait. All factors had significant effects (P < 0.05) on the traits except for region on CI and calving season on DMYL. The overall means for SMY, LL, DMYL, CI, and MYCI were: 1322.3 ± 80.5 kg, 224.8 ± 1.3 days, 5.8 ± 0.1 kg, 555.1 ± 16.5 days, and 3.0 ± 0.1 kg, respectively. The r_e values for SMY, LL, DMYL, CI, and MYCI traits were: 0.19 ± 0.03, 0.08 ± 0.04, 0.16 ± 0.04, 0.00 ± 0.08, and 0.08 ± 0.07, respectively. First parity cows had lower SMY, shorter LL, longer CI, and lower MYCI means than cows with more than one parity. Medium grade cows produced more SMY, DMYL and MYCI and had shorter CI than low- and high-grade cows. Therefore, under Yucatan conditions medium-grade cows should be exploited, and more attention should be given to first parity cows in order to improve the productivity in the herd. The relatively high r_e estimates for SMY and DMYL can be used to calculate most probable producing abilities, in order to identify which cows should be culled.

ABSTRACT. Gaucher disease, the most common lysosomal storage disorder, is currently treated with enzyme replacement therapy. This approach, however, is ineffective in altering the progression of neurodegeneration in type 2 and type 3 patients due to the difficulty of transferring the recombinant enzyme across the blood-brain barrier. Human immunodeficiency virus type 1 trans-activating transcriptional activator protein (HIV TAT) contains a protein transduction domain that can be added to a fusion protein partner to allow for transport of the partner across membranes. Consequently, we examined the creation, production, and secretion of fusion constructs containing glucocerebrosidase and either wild-type TAT or modified TAT in Sf9 cells. All three constructs exhibited successful expression, with wild-type TAT chimeras showing lower levels of expression than modified TAT chimeras.

ABSTRACT. A population of 370 European-Zebu composite beef heifers, consisting of six different breed compositions (A-F), were characterized genetically, using RFLP markers of luteinizing hormone receptor (LHR) and follicle-stimulating hormone receptor (FSHR) genes. Our objectives were to genetically characterize this population and to determine the structure and the genetic variability of this hybrid herd. The genotypes were determined through PCR, followed by digestion with restriction endonucleases. The PCR-RFLP analysis made it possible to identify the LHR and FSHR genotypes, as well as to characterize the degree of heterozygosis, which was high for all of the breed compositions, for both loci, except for two combinations for LHR (B and C). The observed heterozygosity (H_o) was lower than the expected heterozygosity (H_e) for compositions C (for LHR) and A and D (for FSHR); however, for the population as a whole, H_o was above H_e (with a mean of 57 versus 46%, respectively), reflecting the elevated genetic variability in this population and also the informative value of the RFLP markers, which could be useful for population genetic characterization studies. The analysis of the degree of genetic structure of this population, estimated by the Nei’s statistic, for both loci, indicated an elevated total genetic diversity (H_T = 47%), with most of this variability being due to intrapopulational diversity (H_S = 46%), with a low degree of genetic differentiation among the six breed compositions (G_ST = 1.2%). The estimates generated by the Wright’s F statistic indicated a non-endogamic population, with excess heterozygotes (F_IT = -0.22), which was also observed at the intrapopulational level (F_IS = -0.23). The results gave evidence that the genetic selection applied to this European-Zebu composite population did not affect the expected high genetic variability for this type of crossbreeding, which makes it possible to use these animals to obtain economically valuable productive and reproductive traits.

ABSTRACT. We present the MOlecular NETwork (MONET) ontology as a model to integrate data from different networks that govern cell function. To achieve this, different existing ontologies were analyzed and an integrated ontology was built in a way to make it possible to share and reuse knowledge, support interoperability between systems, and also allow the formulation of hypotheses through inferences. By studying the cell as an entity of a myriad of elements and networks of interactions, we aim to offer a means to understand the large-scale characteristics responsible for the behavior of the cell and to enable new biological insights.

ABSTRACT. Several advanced techniques have been proposed for data clustering and many of them have been applied to gene expression data, with partial success. The high dimensionality and the multitude of admissible perspectives for data analysis of gene expression require additional computational resources, such as hierarchical structures and dynamic allocation of resources. We present an immune-inspired hierarchical clustering device, called hierarchical artificial immune network (HaiNet), especially devoted to the analysis of gene expression data. This technique was applied to a newly generated data set, involving maize plants exposed to different aluminum concentrations. The performance of the algorithm was compared with that of a self-organizing map, which is commonly adopted to deal with gene expression data sets. More consistent and informative results were obtained with HaiNet.

ABSTRACT. The computationally challenging problem of reconstructing the phylogeny of a set of contemporary data, such as DNA sequences or morphological attributes, was treated by an extended version of the neighbor-joining (NJ) algorithm. The original NJ algorithm provides a single-tree topology, after a cascade of greedy pairing decisions that tries to simultaneously optimize the minimum evolution and the least squares criteria. Given that some sub-trees are more stable than others, and that the minimum evolution tree may not be achieved by the original NJ algorithm, we propose a multi-neighbor-joining (MNJ) algorithm capable of performing multiple pairing decisions at each level of the tree reconstruction, keeping various partial solutions along the recursive execution of the NJ algorithm. The main advantages of the new reconstruction procedure are: 1) as is the case for the original NJ algorithm, the MNJ algorithm is still a low-cost reconstruction method; 2) a further investigation of the alternative topologies may reveal stable and unstable sub-trees; 3) the chance of achieving the minimum evolution tree is greater; 4) tree topologies with very similar performances will be simultaneously presented at the output. When there are multiple unrooted tree topologies to be compared, a visualization tool is also proposed, using a radial layout to uniformly distribute the branches with the help of well-known metaheuristics used in computer science.

ABSTRACT. Bioinformatics activities are growing all over the world, with proliferation of data and tools. This brings new challenges: how to understand and organize these resources and how to provide interoperability among tools to achieve a given goal. We defined and implemented a framework to help meet some of these challenges. Four issues were considered: the use of Web services as a basic unit, the notion of a Semantic Web to improve interoperability at the syntactic and semantic levels, and the use of scientific workflows to coordinate services to be executed, including their interdependencies and service orchestration.

ABSTRACT. Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and reconfigurability allows for redefinition of the interconnections and operations even during run time (dynamically). We present a reconfigurable systolic architecture that can be applied for the efficient treatment of several dynamic programming methods for resolving well-known problems, such as global and local sequence alignment, approximate string matching and longest common subsequence. The dynamicity of the reconfigurability was found to be useful for practical applications in the construction of sequence alignments. A VHDL (VHSIC hardware description language) version of this new architecture was implemented on an APEX FPGA (Field programmable gate array). It would be several magnitudes faster than the software algorithm alternatives.

ABSTRACT. The necessary information to reproduce and keep an organism is codified in acid nucleic molecules. Deepening the knowledge about how the information is stored in these bio-sequences can lead to more efficient methods of comparing genomic sequences. In the present study, we analyzed the quantity of information contained in a DNA sequence that can be useful to identify sequences homologous to it. To reach it, we used signal processing techniques, specially spectral analysis and information theory.

ABSTRACT. There are many bioinformatics tools that deal with input/output (I/O) issues by using filing systems from the most common operating systems, such as Linux or MS Windows. However, as data volumes increase, there is a need for more efficient disk access, ad hoc memory management and specific page-replacement policies. We propose a device driver that can be used by multiple applications. It keeps the application code unchanged, providing a non-intrusive and flexible strategy for I/O calls that may be adopted in a straightforward manner. With our approach, database developers can define their own I/O management strategies. We used our device driver to manage Basic Local Alignment Search Tool (BLAST) I/O calls. Based on preliminary experimental results with National Center for Biotechnology Information (NCBI) BLAST, this approach can provide database management systems-like data management features, which may be used for BLAST and many other computational biology applications.

ABSTRACT. Genome annotation projects can produce incorrect results if they are based on obsolete data or inappropriate models. We have developed an automatic re-annotation system that uses agents to perform repetitive tasks and reports the results to the user. These tasks involve BLAST searches on biological databases (GenBank) and the use of detection tools (Genemark and Glimmer) to identify new open reading frames. Several agents execute these tools and combine their results to produce a list of open reading frames that is sent back to the user. Our goal was to reduce the manual work, executing most tasks automatically by computational tools. A prototype was implemented and validated using Mycoplasma pneumoniae and Haemophilus influenzae original annotated genomes. The results reported by the system identify most of new features present in the re-annotated versions of these genomes.

ABSTRACT. We developed a new approach for the reconstruction of phylogenetic trees using ant colony optimization metaheuristics. A tree is constructed using a fully connected graph and the problem is approached similarly to the well-known traveling salesman problem. This methodology was used to develop an algorithm for constructing a phylogenetic tree using a pheromone matrix. Two data sets were tested with the algorithm: complete mitochondrial genomes from mammals and DNA sequences of the p53 gene from several eutherians. This new methodology was found to be superior to other well-known softwares, at least for this data set. These results are very promising and suggest more efforts for further developments.

ABSTRACT. Interpro is a widely used tool for protein annotation in genome sequencing projects, demanding a large amount of computation and representing a huge time-consuming step. We present a strategy to execute programs using databases Pfam, PROSITE and ProDom of Interpro in a distributed environment using a Java-based messaging system. We developed a two-layer scheduling architecture of the distributed infrastructure. Then, we made experiments and analyzed the results. Our distributed system gave much better results than Interpro Pfam, PROSITE and ProDom running in a centralized platform. This approach seems to be appropriate and promising for highly demanding computational tools used for biological applications.

ABSTRACT. Microarrays are a new technology that allows biologists to better understand the interactions between diverse pathologic state at the gene level. However, the amount of data generated by these tools becomes problematic, even though data are supposed to be automatically analyzed (e.g., for diagnostic purposes). The issue becomes more complex when the expression data involve multiple states. We present a novel approach to the gene selection problem in multi-class gene expression-based cancer classification, which combines support vector machines and genetic algorithms. This new method is able to select small subsets and still improve the classification accuracy.

ABSTRACT. Novelty detection techniques might be a promising way of dealing with high-dimensional classification problems in Bioinformatics. We present preliminary results of the use of a one-class support vector machine approach to detect novel classes in two Bioinformatics databases. The results are compatible with theory and inspire further investigation.