Eucalyptus ESTs associated with resistance to herbicide inhibitors of aromatic and branched-chain amino acid synthesis

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

Taxonomic and phylogenetic relationships between neotropical species of ticks from genus Amblyomma (Acari: Ixodidae) inferred from second internal transcribed spacer sequences of rDNA

The accurate specific identification of ticks is essential for the study, control and prevention of tick-borne diseases. Herein, we determined ribosomal nucleotide sequences of the second internal transcribed spacer (ITS2) of 15 Neotropical hard tick species of the genus Amblyomma Koch found in Brazil. Most of the studied ticks accidentally parasite humans and potentially act as vectors of zoonoses. Lengths of the ITS2 sequences ranged from 956 to 1,207 bp, whereas GC content varied from 62.4 to 66.9%. A matrix of ITS2 divergence was calculated with the ITS2 sequence data obtained showing divergence levels varying from 1.5 to 28.8%. The analysis indicated that this molecular marker can be useful for Amblyomma-specific identification. Phylogenetic inferences based on the ITS2 sequences were used to assess some issues in subgenus taxonomy. © 2007 Entomological Society of America.

Identification of blood meal sources of Lutzomyia longipalpis using polymerase chain reaction-restriction fragment length polymorphism analysis of the cytochrome B gene

An analysis of the dietary content of haematophagous insects can provide important information about the transmission networks of certain zoonoses. The present study evaluated the potential of polymerase chain reaction-restriction fragment length polymorphism (PCR-RFLP) analysis of the mitochondrial cytochrome B (cytb) gene to differentiate between vertebrate species that were identified as possible sources of sandfly meals. The complete cytb gene sequences of 11 vertebrate species available in the National Center for Biotechnology Information database were digested with Aci I, Alu I, Hae III and Rsa I restriction enzymes in silico using Restriction Mapper software. The cytb gene fragment (358 bp) was amplified from tissue samples of vertebrate species and the dietary contents of sandflies and digested with restriction enzymes. Vertebrate species presented a restriction fragment profile that differed from that of other species, with the exception of Canis familiaris and Cerdocyon thous. The 358 bp fragment was identified in 76 sandflies. Of these, 10 were evaluated using the restriction enzymes and the food sources were predicted for four: Homo sapiens (1), Bos taurus (1) and Equus caballus (2). Thus, the PCR-RFLP technique could be a potential method for identifying the food sources of arthropods. However, some points must be clarified regarding the applicability of the method, such as the extent of DNA degradation through intestinal digestion, the potential for multiple sources of blood meals and the need for greater knowledge regarding intraspecific variations in mtDNA.

Construction and decoding of BCH codes over chain of commutative rings

In this paper, we present a new construction and decoding of BCH codes over certain rings. Thus, for a nonnegative integer t, let A0 ⊂ A1 ⊂···⊂ At−1 ⊂ At be a chain of unitary commutative rings, where each Ai is constructed by the direct product of appropriate Galois rings, and its projection to the fields is K0 ⊂ K1 ⊂···⊂ Kt−1 ⊂ Kt (another chain of unitary commutative rings), where each Ki is made by the direct product of corresponding residue fields of given Galois rings. Also, A∗ i and K∗ i are the groups of units of Ai and Ki, respectively. This correspondence presents a construction technique of generator polynomials of the sequence of Bose, Chaudhuri, and Hocquenghem (BCH) codes possessing entries from A∗ i and K∗ i for each i, where 0 ≤ i ≤ t. By the construction of BCH codes, we are confined to get the best code rate and error correction capability; however, the proposed contribution offers a choice to opt a worthy BCH code concerning code rate and error correction capability. In the second phase, we extend the modified Berlekamp-Massey algorithm for the above chains of unitary commutative local rings in such a way that the error will be corrected of the sequences of codewords from the sequences of BCH codes at once. This process is not much different than the original one, but it deals a sequence of codewords from the sequence of codes over the chain of Galois rings.