ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

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
  • Plasmodesma  (1)
  • expansive tree grammars  (1)
  • Springer  (2)
  • 1
    ISSN: 1432-2048
    Keywords: Key words: Aerenchyma ; Cell death ; Oryza ; Plasmodesma ; Root
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology
    Notes: Abstract. Cellular events which occur prior to cell collapse were examined in the root cortex of rice (Oryza sativa L.) during aerenchyma formation. Cell collapse started at a specific position in the mid cortex. These cells were distinct in shape from those located towards the periphery. Furthermore, cell collapse was preceded by acidification and the loss of plasma-membrane integrity in cells of the mid cortex. Subsequent death of neighboring cells followed a radial path. Microinjection of molecules of different sizes conjugated with fluorescein isothiocyanate (FITC) showed a molecular exclusion limit of between 9.3 and 19.6 kDa in the root cortex. Furthermore, large molecules, i.e. those around 9.3 kDa, were predominantly transferred in a radial direction, which coincided with the path of sequential cell death.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    International journal of parallel programming 12 (1983), S. 1-11 
    ISSN: 1573-7640
    Keywords: Trees ; regular expressions ; expansive tree grammars ; regularity-preserving transformations ; context-free languages
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Regular-like expressions provide a compact notation for the explicit description of context-free languages. In this paper we extend these concepts by establishing a one-to-one correspondence between expansive tree languages and regular-like sets of trees. Algorithms are developed for constructing an expansive tree grammar whose language is defined by a given regular-like tree (RLT) expression, and vice versa. These results are then used to obtain RLT equations that describe sets of tree resulting from regularity-preserving transformations associated with three types of errors commonly found in practice.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...