1.

Record Nr.

UNINA9910458848203321

Autore

Srivastava L. M (Lalit Mohan), <1932->

Titolo

Plant growth and development [[electronic resource] ] : hormones and environment / / Lalit M. Srivastava

Pubbl/distr/stampa

Amsterdam ; ; Boston, : Academic Press, c2002

ISBN

1-281-75565-6

9786611755652

0-08-051403-0

Descrizione fisica

1 online resource (795 p.)

Disciplina

571.8/2

Soggetti

Growth (Plants)

Plants - Development

Plant hormones

Electronic books.

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Description based upon print version of record.

Nota di bibliografia

Includes bibliographical references and index.

Nota di contenuto

Front Cover; Plant Growth and Development: Hormones and Environment; Copyright Page; Contents; Preface; List of Reviewers; SECTION I: SOME SPECIAL ASPECTS OF PLANT GROWTH AND DEVELOPMENT; Chapter 1. Special Features of Plant Development; 1. Plants Have Evolved Some Novel Strategies For survival; 2. Growth, Differentiation, and Morphogenesis; 3. Organization of the Plant Body; 4. Plant Development Involves Commitments; 5. External or Internal Perturbations May Cause a Reversal of Established Commitments; 6. Chapter Summary; References; Chapter 2. Cell Wall, Cell Division, and Cell Growth

SECTION I: CELL WALLSSECTION II: CELL DIVISION; SECTION III: CELL GROWTH IN PLANTS; SECTION IV: CYTOSKELETON PLAYS IMPORTANT ROLES IN CELL GROWTH, CELL SHAPE, AND CELL DIFFERENTIATION; References; Chapter 3. Embryogenesis; 1. Introduction; 2. Embryogenesis in Arabidopsis; 3. Genetic Dissection of Pattern Formation in Arabidopsis Embryos; 4. Analysis of Mutant Phenotypes in Maize and Rice; 5. Cloning and Characterization of Genes; 6. Embryogenesis in Other Plants; 7. Control of Patterning in Embryo



Development; 8. Somatic Embryogenesis; 9. Chapter Summary; References

Chapter 4. Determination, Differentiation, and Dedifferentiaion in Plants1. Commitment, Determination, and Differentiation; 2. Commitment Occurs in Steps, and Choices at Each Step Are Limited to a Few Options; 3. Role of Cell Divisions in Determination; 4. Mechanism of Differentiation; 5. Role of Cytoplasm; 6. Stability and Transmission of Determined States; 7. How Is the Determined State Maintained?; 8. Dedifferentiation and Redifferentiation; 9. Chapter Summary; References; Appendix 1. Molecular and Genetic Tools for Study of Plant Development; 1. Introduction

2. Regulation of Gene Expression3. In Vitro Transcription; 4. Genetic Techniques; 5. Other Techniques; 6. Nomenclature of Genes, Mutants, and Proteins; References; SECTION II: STRUCTURE AND METABOLISM OF PLANT HORMONES; Chapter 5. General Features of Plant Hormones, Their Analysis, and Quantitation; 1. Discovery of Auxin and Other Hormones; 2. Characteristics of Plant Hormones; 3. Hormone vs Plant Growth Regulator; 4. Hormonal Responses Are Specific to a Physiological State; 5. Bioassays; 6. Hormone Extraction, Analysis, and Quantitation; 7. Determination of Hormone Synthetic Pathways

8. Regulation of Hormone Levels (Hormonal Homeostasis)9. Chapter Summary; References; Chapter 6. Auxins; 1. The Term ""Auxin"" Includes a Variety of Structurally Unrelated Compounds; 2. Indole Acetic Acid (IAA) Is the Major Naturally Occuring Auxin; 3. Physiological Roles of IAA; 4. IAA Biosynthesis in Higher Plants; 5. Regulation of IAA Levels (IAA Homeostasis); 6. Inhibitors of IAA Action; 7. Other Naturally Occuring Auxins; 8. Synthetic Auxins; 9. Structural Diversity of Auxins; 10. Chapter Summary; References; Chapter 7. Gibberellins; 1. Discovery

2. Structure of Gibberellins (GAs) in Higher Plants

Sommario/riassunto

This book provides current information on synthesis of plant hormones, how their concentrations are regulated, and how they modulate various plant processes. It details how plants sense and tolerate such factors as drought, salinity, and cold temperature, factors that limit plant productivity on earth. It also explains how plants sense two other environmental signals, light and gravity, and modify their developmental patterns in response to those signals. This book takes the reader from basic concepts to the most up-to-date thinking on these topics.* Provides clear synthesis and re



2.

Record Nr.

UNISA996466364503316

Titolo

Combinatorial Algorithms [[electronic resource] ] : 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings / / edited by Charles J. Colbourn, Roberto Grossi, Nadia Pisanti

Pubbl/distr/stampa

Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019

ISBN

3-030-25005-9

Edizione

[1st ed. 2019.]

Descrizione fisica

1 online resource (XIX, 456 p. 335 illus., 47 illus. in color.)

Collana

Theoretical Computer Science and General Issues, , 2512-2029 ; ; 11638

Disciplina

511.6

Soggetti

Computer science—Mathematics

Discrete mathematics

Algorithms

Artificial intelligence—Data processing

Computer arithmetic and logic units

Computer graphics

Discrete Mathematics in Computer Science

Data Science

Arithmetic and Logic Structures

Computer Graphics

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Nota di bibliografia

Includes bibliographical references and index.

Nota di contenuto

A note on handicap incomplete tournaments -- Computing the k-Crossing Visibility Region of a Point in a Polygon -- An Improved Scheme in the Two Query Adaptive Bitprobe Model -- On Erdős‒Szekeres-type problems for k-convex point sets -- Algorithms and Hardness results on Liar's Dominating Set and k-tuple Dominating Set -- Fixed-parameter tractability of (n-k) List Coloring -- Finding Periods in Cartesian Tree Matching -- Parameterized Complexity of Min-Power Asymmetric Connectivity -- Solving Group Interval Scheduling Efficiently -- Call Admission on Trees with Advice (Extended Abstract) -- Power Edge Set and Zero Forcing Set remain difficult in cubic graphs -- Towards a Complexity Dichotomy for Colourful Components



Problems on k-caterpillars and Small-Degree Planar Graphs -- Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs -- Dual Domination -- Reaching 3-Connectivity via Edge-edge Additions -- Cops and robber on some families of oriented graphs -- Disjoint clustering in combinatorial circuits -- The hull number in the convexity of induced paths of order 3 -- Supermagic graphs with many odd degrees -- Incremental algorithm for minimum cut and edge connectivity in Hypergraph -- A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications -- Shortest-Path-Preserving Rounding -- Complexity and Algorithms for Semipaired Domination in Graphs -- Computing the Rooted Triplet Distance between Phylogenetic Networks -- Parameterized Algorithms for Graph Burning Problem -- Extension and its price for the connected vertex cover problem -- An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number -- An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs -- Complexity of fall coloring for restricted graph classes -- Succinct Representation of Linear Extensions via MDDs and Its Application to Scheduling under Precedence Constraints -- Maximum clique exhaustive search in circulant k-hypergraphs -- Burrows-Wheeler transform of words defined by morphisms -- Stable Noncrossing Matchings -- On the Average Case of MergeInsertion -- Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings -- A Partition Approach to Lower Bounds for Zero-Visibility Cops and Robber.

Sommario/riassunto

This book constitutes the refereed post-conference proceedings of the 30th International Workshop on Combinatorial Algorithms, IWOCA 2019, held in Pisa, Italy, in July 2019. The 36 regular papers presented in this volume were carefully reviewed and selected from 73 submissions. They cover diverse areas of combinatorical algorithms, complexity theory, graph theory and combinatorics, combinatorial optimization, cryptography and information security, algorithms on strings and graphs, graph drawing and labelling, computational algebra and geometry, computational biology, probabilistic and randomized algorithms, algorithms for big data analytics, and new paradigms of computation.