Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • 2000-2004  (2)
  • alternant code  (1)
  • domain  (1)
  • scFv  (1)
  • 1
    ISSN: 1572-9788
    Keywords: antibody ; GBSS I ; plant expression ; PVX vector ; scFv
    Source: Springer Online Journal Archives 1860-2000
    Topics: Agriculture, Forestry, Horticulture, Fishery, Domestic Science, Nutrition
    Notes: Abstract Antibodies have been expressed in plants to confer novel traits such as virus resistance or altered phenotype. However, not every antibody is suitable for plant expression, and successful intracellular expression of antibody fragments depends primarily on their amino acid sequence in a way that is as yet unpredictable. Therefore it is desirable to assess different constructs before embarking on the production of transgenic plants. We have used a transient expression system based on potato virus X to compare different cDNA constructs for expression and stability of antibody variable gene fragments in plants. Constructs contained an anti-plant enzyme (granule-bound starch synthase I) scFv sequence derived from a naive phage display library together with different combinations of sequences encoding the human IgG κ constant domain, a murine IgG secretory signal sequence, or the endoplasmic reticulum retention signal peptide KDEL. The results obtained with the potato virus X vector correlated with those from Agrobacterium-mediated stable transformation of potato. The best expression levels were obtained by incorporating sequences that target scFv to the lumen of the endoplasmic reticulum and the secretory pathway. The anti-enzyme scFv retained activity during storage of potato tubers for more than five months. The results demonstrate the utility of the potato virus X vector for the analysis and comparison of many scFv with different epitope specificities or sequence modifications. Evaluation of scFv by transient expression from the PVX vector should aid progress in selection of functional scFv for applications in plant biotechnology.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Designs, codes and cryptography 20 (2000), S. 125-141 
    ISSN: 1573-7586
    Keywords: alternant code ; domain ; local ring ; minimal polynomial ; decoding algorithm
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We define alternant codes over a commutative ring R and a corresponding key equation. We show that when the ring is a domain, e.g. the p-adic integers, the error-locator polynomial is the unique monic minimal polynomial (equivalently, the unique shortest linear recurrence) of the finite sequence of syndromes and that it can be obtained by Algorithm MR of Norton. WhenR is a local ring, we show that the syndrome sequence may have more than one (monic) minimal polynomial, but that all the minimal polynomials coincide modulo the maximal ideal ofR . We characterise the set of minimal polynomials when R is a Hensel ring. We also apply these results to decoding alternant codes over a local ring R: it is enough to find any monic minimal polynomial over R and to find its roots in the residue field. This gives a decoding algorithm for alternant codes over a finite chain ring, which generalizes and improves a method of Interlando et. al. for BCH and Reed-Solomon codes over a Galois ring.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...