Draft Genome Sequence of the Nitrogen-Fixing Symbiotic Bacterium Bradyrhizobium elkanii 587

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Effect of sequence of insemination after simultaneous thawing of multiple semen straws on conception rate to timed AI in suckled multiparous Nelore cows

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Carbohydrate Composition and Water-Stable Aggregation of an Oxisol as Affected by Crop Sequence under No-Till

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Distinctively variable sequence-based nuclear DNA markers for multilocus phylogeography of the soybean- and rice-infecting fungal pathogen Rhizoctonia solani AG-1 IA

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

The Genome Sequence of Taurine Cattle: A Window to Ruminant Biology and Evolution

To understand the biology and evolution of ruminants, the cattle genome was sequenced to about sevenfold coverage. The cattle genome contains a minimum of 22,000 genes, with a core set of 14,345 orthologs shared among seven mammalian species of which 1217 are absent or undetected in noneutherian (marsupial or monotreme) genomes. Cattle-specific evolutionary breakpoint regions in chromosomes have a higher density of segmental duplications, enrichment of repetitive elements, and species-specific variations in genes associated with lactation and immune responsiveness. Genes involved in metabolism are generally highly conserved, although five metabolic genes are deleted or extensively diverged from their human orthologs. The cattle genome sequence thus provides a resource for understanding mammalian evolution and accelerating livestock genetic improvement for milk and meat production.

The contribution of 700,000 ORF sequence tags to the definition of the human transcriptome

open reading frame expressed sequences tags (ORESTES) differ from conventional ESTs by providing sequence data from the central protein coding portion of transcripts. We generated a total of 696,745 ORESTES sequences from 24 human tissues and used a subset of the data that correspond to a set of 15,095 full-length mRNAs as a means of assessing the efficiency of the strategy and its potential contribution to the definition of the human transcriptome. We estimate that ORESTES sampled over 80% of all highly and moderately expressed, and between 40% and 50% of rarely expressed, human genes. In our most thoroughly sequenced tissue, the breast, the 130,000 ORESTES generated are derived from transcripts from an estimated 70% of all genes expressed in that tissue, with an equally efficient representation of both highly and poorly expressed genes. In this respect, we find that the capacity of the ORESTES strategy both for gene discovery and shotgun transcript sequence generation significantly exceeds that of conventional ESTs. The distribution of ORESTES is such that many human transcripts are now represented by a scaffold of partial sequences distributed along the length of each gene product. The experimental joining of the scaffold components, by reverse transcription-PCR, represents a direct route to transcript finishing that may represent a useful alternative to full-length cDNA cloning.

Predictor-Corrector Primal-Dual Interior Point Method for Solving Economic Dispatch Problems: A Postoptimization Analysis

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

An efficient Hopfield network to solve economic dispatch problems with transmission system representation

Economic dispatch (ED) problems have recently been solved by artificial neural network approaches. Systems based on artificial neural networks have high computational rates due to the use of a massive number of simple processing elements and the high degree of connectivity between these elements. The ability of neural networks to realize some complex non-linear function makes them attractive for system optimization. All ED models solved by neural approaches described in the literature fail to represent the transmission system. Therefore, such procedures may calculate dispatch policies, which do not take into account important active power constraints. Another drawback pointed out in the literature is that some of the neural approaches fail to converge efficiently toward feasible equilibrium points. A modified Hopfield approach designed to solve ED problems with transmission system representation is presented in this paper. The transmission system is represented through linear load flow equations and constraints on active power flows. The internal parameters of such modified Hopfield networks are computed using the valid-subspace technique. These parameters guarantee the network convergence to feasible equilibrium points, which represent the solution for the ED problem. Simulation results and a sensitivity analysis involving IEEE 14-bus test system are presented to illustrate efficiency of the proposed approach. (C) 2004 Elsevier Ltd. All rights reserved.

An efficient neural approach to economic load dispatch in power systems

A neural approach to solve the problem defined by the economic load dispatch in power systems is presented in this paper, Systems based on artificial neural networks have high computational rates due to the use of a massive number of simple processing elements and the high degree of connectivity between these elements the ability of neural networks to realize some complex nonlinear function makes them attractive for system optimization the neural networks applyed in economic load dispatch reported in literature sometimes fail to converge towards feasible equilibrium points the internal parameters of the modified Hopfield network developed here are computed using the valid-subspace technique These parameters guarantee the network convergence to feasible quilibrium points, A solution for the economic load dispatch problem corresponds to an equilibrium point of the network. Simulation results and comparative analysis in relation to other neural approaches are presented to illustrate efficiency of the proposed approach.

Reactive power dispatch and planning using a non-linear branch-and-bound algorithm

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

An effortless hybrid method to solve economic load dispatch problem in power systems

This paper proposes a new approach and coding scheme for solving economic dispatch problems (ED) in power systems through an effortless hybrid method (EHM). This novel coding scheme can effectively prevent futile searching and also prevents obtaining infeasible solutions through the application of stochastic search methods, consequently dramatically improves search efficiency and solution quality. The dominant constraint of an economic dispatch problem is power balance. The operational constraints, such as generation limitations, ramp rate limits, prohibited operating zones (POZ), network loss are considered for practical operation. Firstly, in the EHM procedure, the output of generator is obtained with a lambda iteration method and without considering POZ and later in a genetic based algorithm this constraint is satisfied. To demonstrate its efficiency, feasibility and fastness, the EHM algorithm was applied to solve constrained ED problems of power systems with 6 and 15 units. The simulation results obtained from the EHM were compared to those achieved from previous literature in terms of solution quality and computational efficiency. Results reveal that the superiority of this method in both aspects of financial and CPU time. (C) 2011 Elsevier Ltd. All rights reserved.

Analysis and functional annotation of an expressed sequence tag collection for tropical crop sugarcane

To contribute to our understanding of the genome complexity of sugarcane, we undertook a large-scale expressed sequence tag (EST),program. More than 260,000 cDNA clones were partially sequenced from 26 standard cDNA libraries generated from different sugarcane tissues. After the processing of the sequences, 237,954 high-quality ESTs were identified. These ESTs were assembled into 43,141 putative transcripts. of the assembled sequences, 35.6% presented no matches with existing sequences in public databases. A global analysis of the whole SUCEST data set indicated that 14,409 assembled sequences (33% of the total) contained at least one cDNA clone with a full-length insert. Annotation of the 43,141 assembled sequences associated almost 50% of the putative identified sugarcane genes with protein metabolism, cellular communication/signal transduction, bioenergetics, and stress responses. Inspection of the translated assembled sequences for conserved protein domains revealed 40,821 amino acid sequences with 1415 Pfam domains. Reassembling the consensus sequences of the 43,141 transcripts revealed a 22% redundancy in the first assembling. This indicated that possibly 33,620 unique genes had been identified and indicated that >90% of the sugarcane expressed genes were tagged.

A first case of protease codon 35 amino acid insertion in a HIV-1 subtype B sequence detected in the Bauru region, state of São Paulo, Brazil: case report

Inserções de aminoácidos na protease têm sido raramente descritas em pacientes infectados pelo HIV. Uma destas inserções foi, recentemente, descrita no codon 35, embora seu impacto na resistência mantém-se pouco conhecido. Este trabalho apresenta um caso de uma variante viral com inserção no codon 35 da protease, descrita pela primeira vez em Bauru, São Paulo, Brasil, circulante em um homem, caucasiano, com 38 anos, o qual apresenta infecção assintomática pelo HIV desde 1997. A variante isolada mostrou uma inserção no codon 35 da protease de dois aminoácidos: uma treonina e um ácido aspártico, resultando na sequência de aminoácidos E35E_TD.

cDNA sequence and molecular modeling of a nerve growth factor from Bothrops jararacussu venomous gland

The complete nucleotide sequence of a nerve growth factor precursor from Bothrops jararacussu snake (Bj-NGF) was determined by DNA sequencing of a clone from cDNA library prepared from the poly(A) + RNA of the venom gland of B.jararacussu. cDNA encoding Bj-NGF precursor contained 723 bp in length, which encoded a prepro-NGF molecule with 241 amino acid residues. The mature Bj-NGF molecule was composed of I 18 amino acid residues with theoretical pI and molecular weight of 8.31 and 13,537, respectively. Its amino acid sequence showed 97%, 96%, 93%, 86%, 78%, 74%, 76%, 76% and 55% sequential similarities with NGFs from Crotalus durissus terrificus, Agkistrodon halys pallas, Daboia (Vipera) russelli russelli, Bungarus multicinctus, Naja sp., mouse, human, bovine and cat, respectively. Phylogenetic analyses based on the amino acid sequences of 15 NGFs separate the Elapidae family (Naja and Bungarus) from those Crotalidae snakes (Bothrops, Crotalus and Agkistrodon). The three-dimensional structure of mature Bj-NGF was modeled based on the crystal structure of the human NGF. The model reveals that the core of NGF, formed by a pair of P-sheets, is highly conserved and the major mutations are both at the three beta-hairpin loops and at the reverse turn. (C) 2002 Societe francaise de biochimie et biologic moleculaire/Editions scientifiques et medicales Elsevier SAS. All rights reserved.

Structural basis for the specificity of bipartite nuclear localization sequence binding by importin-alpha

Importin-alpha is the nuclear import receptor that recognizes cargo proteins carrying conventional basic monopartite and bipartite nuclear localization sequences (NLSs) and facilitates their transport into the nucleus. Bipartite NLSs contain two clusters of basic residues, connected by linkers of variable lengths. To determine the structural basis of the recognition of diverse bipartite NLSs by mammalian importin-alpha, we co-crystallized a non-autoinhibited mouse receptor protein with peptides corresponding to the NLSs from human retinoblastoma protein and Xenopus laevis phosphoprotein N1N2, containing diverse sequences and lengths of the linker. We show that the basic clusters interact analogously in both NLSs, but the linker sequences adopt different conformations, whereas both make specific contacts with the receptor. The available data allow us to draw general conclusions about the specificity of NLS binding by importin-alpha and facilitate an improved definition of the consensus sequence of a conventional basic/bipartite NLS (KRX10-12KRRK) that can be used to identify novel nuclear proteins.