Relevant bibliographies by topics / Generating trees

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Generating trees'

Author: Grafiati
Published: 25 June 2021
Last updated: 11 March 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Generating trees.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Generating trees"

1

Banderier, Cyril, Mireille Bousquet-Mélou, Alain Denise, Philippe Flajolet, Danièle Gardy, and Dominique Gouyou-Beauchamps. "Generating functions for generating trees." Discrete Mathematics 246, no. 1-3 (March 2002): 29–55. http://dx.doi.org/10.1016/s0012-365x(01)00250-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Skarbek, Wladyslaw. "Generating ordered trees." Theoretical Computer Science 57, no. 1 (April 1988): 153–59. http://dx.doi.org/10.1016/0304-3975(88)90169-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Mlinarić, Danijel, Vedran Mornar, and Boris Milašinović. "Generating Trees for Comparison." Computers 9, no. 2 (April 29, 2020): 35. http://dx.doi.org/10.3390/computers9020035.

Full text
Abstract:
Tree comparisons are used in various areas with various statistical or dissimilarity measures. Given that data in various domains are diverse, and a particular comparison approach could be more appropriate for specific applications, there is a need to evaluate different comparison approaches. As gathering real data is often an extensive task, using generated trees provides a faster evaluation of the proposed solutions. This paper presents three algorithms for generating random trees: parametrized by tree size, shape based on the node distribution and the amount of difference between generated trees. The motivation for the algorithms came from unordered trees that are created from class hierarchies in object-oriented programs. The presented algorithms are evaluated by statistical and dissimilarity measures to observe stability, behavior, and impact on node distribution. The results in the case of dissimilarity measures evaluation show that the algorithms are suitable for tree comparison.
APA, Harvard, Vancouver, ISO, and other styles
4

Pikhurko, Oleg. "Generating Edge-Labeled Trees." American Mathematical Monthly 112, no. 10 (December 1, 2005): 919. http://dx.doi.org/10.2307/30037632.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Pallo, J. "Generating trees withnnodes andmleaves." International Journal of Computer Mathematics 21, no. 2 (January 1987): 133–44. http://dx.doi.org/10.1080/00207168708803562.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Pikhurko, Oleg. "Generating Edge-Labeled Trees." American Mathematical Monthly 112, no. 10 (December 2005): 919–21. http://dx.doi.org/10.1080/00029890.2005.11920268.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sibun, Penelope. "GENERATING TEXT WITHOUT TREES." Computational Intelligence 8, no. 1 (February 1992): 102–22. http://dx.doi.org/10.1111/j.1467-8640.1992.tb00340.x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

West, J. "Generating trees and forbidden subsequences." Discrete Mathematics 157, no. 1-3 (October 1, 1996): 271–83. http://dx.doi.org/10.1016/0012-365x(95)00271-w.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ruskey, Frank, and Andrzej Proskurowski. "Generating binary trees by transpositions." Journal of Algorithms 11, no. 1 (March 1990): 68–84. http://dx.doi.org/10.1016/0196-6774(90)90030-i.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Atkinson, M. D., and J. R. Sack. "Generating binary trees at random." Information Processing Letters 41, no. 1 (January 1992): 21–23. http://dx.doi.org/10.1016/0020-0190(92)90075-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Generating trees"

1

Belbaraka, Mounir. "Algorithms for generating and coding B-Trees." Thesis, University of Ottawa (Canada), 1996. http://hdl.handle.net/10393/9826.

Full text
Abstract:
Gupta, Lee and Wong described algorithms for generating 2-3 trees and B-trees with a given number of nodes and left as open problems whether algorithms exist that generate them in lexicographic order, and whether it is possible to generate 2-3 trees (GLW) or B-Trees (GLW1) in constant average delay, exclusive of the output. In this thesis, we propose solutions to the open problems in both (GLW) and (GLW1). The main results of this thesis are: introducing a new notation of B-Trees which provides lexicographic order and a proof that (GLW) and (GLW1) algorithms do have a constant average delay (thus solving two open problems posed by Gupta, Lee and Wong). A new algorithm for generating 2-3 trees, with a given number of nodes, in lexicographic order is also presented. This algorithm is an improvement over (GLW) in terms of time complexity and storage. An algorithm for lexicographic generation of B-Trees with a given number of leaves is described. Finally new algorithms for coding and decoding B-Trees sequentially are described.
APA, Harvard, Vancouver, ISO, and other styles
2

Doherty, Kevin Anthony James. "Generating neural trees with topology preserving clustering." Thesis, University of Hertfordshire, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.427540.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

PEREIRA, FELIPE DE ALBUQUERQUE MELLO. "A FRAMEWORK FOR GENERATING BINARY SPLITS IN DECISION TREES." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2018. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=35783@1.

Full text
Abstract:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO
CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO
Nesta dissertação é apresentado um framework para desenvolver critérios de split para lidar com atributos nominais multi-valorados em árvores de decisão. Critérios gerados por este framework podem ser implementados para rodar em tempo polinomial no número de classes e valores, com garantia teórica de produzir um split próximo do ótimo. Apresenta-se também um estudo experimental, utilizando datasets reais, onde o tempo de execução e acurácia de métodos oriundos do framework são avaliados.
In this dissertation we propose a framework for designing splitting criteria for handling multi-valued nominal attributes for decision trees. Criteria derived from our framework can be implemented to run in polynomial time in the number of classes and values, with theoretical guarantee of producing a split that is close to the optimal one. We also present an experimental study, using real datasets, where the running time and accuracy of the methods obtained from the framework are evaluated.
APA, Harvard, Vancouver, ISO, and other styles
4

McCann, David Page. "Using GIS and landowner survey to determine if the Forest Stewardship Program is effective at generating involvement in forest health issues in West Virginia." Morgantown, W. Va. : [West Virginia University Libraries], 2005. https://eidr.wvu.edu/etd/documentdata.eTD?documentid=4420.

Full text
Abstract:
Thesis (M.S.)--West Virginia University, 2005.
Title from document title page. Document formatted into pages; contains vii, 209 p. : ill., col. maps. Includes abstract. Includes bibliographical references (p. 49-52).
APA, Harvard, Vancouver, ISO, and other styles
5

Cervetti, Matteo. "Pattern posets: enumerative, algebraic and algorithmic issues." Doctoral thesis, Università degli studi di Trento, 2003. http://hdl.handle.net/11572/311140.

Full text
Abstract:
The study of patterns in combinatorial structures has grown up in the past few decades to one of the most active trends of research in combinatorics. Historically, the study of permutations which are constrained by not containing subsequences ordered in various prescribed ways has been motivated by the problem of sorting permutations with certain devices. However, the richness of this notion became especially evident from its plentiful appearances in several very different disciplines, such as pure mathematics, mathematical physics, computer science, biology, and many others. In the last decades, similar notions of patterns have been considered on discrete structures other than permutations, such as integer sequences, lattice paths, graphs, matchings and set partitions. In the first part of this talk I will introduce the general framework of pattern posets and some classical problems about patterns. In the second part of this talk I will present some enumerative results obtained in my PhD thesis about patterns in permutations, lattice paths and matchings. In particular I will describe a generating tree with a single label for permutations avoiding the vincular pattern 1 - 32 - 4, a finite automata approach to enumerate lattice excursions avoiding a single pattern and some results about matchings avoiding juxtapositions and liftings of patterns.
APA, Harvard, Vancouver, ISO, and other styles
6

Kubiš, František. "Generování 3D stromů na základě vzorových obrázků." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2013. http://www.nusl.cz/ntk/nusl-236420.

Full text
Abstract:
Master's thesis studies the possibilities of generating 3D trees using variety of methods including context-free grammars and L-systems. Master's thesis also includes chapter on evolutionary and genetic algorithms, which briefly summarize their function. In this project genetic algorithm which takes 2D image of tree and the beginning of its trunk is proposed. Based on this information it will generate 3D tree which is visually close to the original image. In addition to methods of generating trees, reader will get information about processing input image and designing test application.
APA, Harvard, Vancouver, ISO, and other styles
7

Cervetti, Matteo. "Pattern posets: enumerative, algebraic and algorithmic issues." Doctoral thesis, Università degli studi di Trento, 2021. http://hdl.handle.net/11572/311152.

Full text
Abstract:
The study of patterns in combinatorial structures has grown up in the past few decades to one of the most active trends of research in combinatorics. Historically, the study of permutations which are constrained by not containing subsequences ordered in various prescribed ways has been motivated by the problem of sorting permutations with certain devices. However, the richness of this notion became especially evident from its plentiful appearances in several very different disciplines, such as pure mathematics, mathematical physics, computer science,biology, and many others. In the last decades, similar notions of patterns have been considered on discrete structures other than permutations, such as integer sequences, lattice paths, graphs, matchings and set partitions. In the first part of this talk I will introduce the general framework of pattern posets and some classical problems about patterns. In the second part of this talk I will present some enumerative results obtained in my PhD thesis about patterns in permutations, lattice paths and matchings. In particular I will describe a generating tree with a single label for permutations avoiding the vincular pattern 1 - 32 - 4, a finite automata approach to enumerate lattice excursions avoiding a single pattern and some results about matchings avoiding juxtapositions and liftings of patterns.
APA, Harvard, Vancouver, ISO, and other styles
8

Cervetti, Matteo. "Pattern posets: enumerative, algebraic and algorithmic issues." Doctoral thesis, Università degli studi di Trento, 2021. http://hdl.handle.net/11572/311152.

Full text
Abstract:
The study of patterns in combinatorial structures has grown up in the past few decades to one of the most active trends of research in combinatorics. Historically, the study of permutations which are constrained by not containing subsequences ordered in various prescribed ways has been motivated by the problem of sorting permutations with certain devices. However, the richness of this notion became especially evident from its plentiful appearances in several very different disciplines, such as pure mathematics, mathematical physics, computer science, biology, and many others. In the last decades, similar notions of patterns have been considered on discrete structures other than permutations, such as integer sequences, lattice paths, graphs, matchings and set partitions. In the first part of this talk I will introduce the general framework of pattern posets and some classical problems about patterns. In the second part of this talk I will present some enumerative results obtained in my PhD thesis about patterns in permutations, lattice paths and matchings. In particular I will describe a generating tree with a single label for permutations avoiding the vincular pattern 1 - 32 - 4, a finite automata approach to enumerate lattice excursions avoiding a single pattern and some results about matchings avoiding juxtapositions and liftings of patterns.
APA, Harvard, Vancouver, ISO, and other styles
9

Ma̧dry, Aleksander. "Faster generation of random spanning trees." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/55126.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 39-40).
In this thesis, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is within a multiplicative (1+6) of uniform in expected time ... . This improves the sparse graph case of the best previously known worst-case bound of O(min{mn, n2. 376}), which has stood for twenty years. To achieve this goal, we exploit the connection between random walks on graphs and electrical networks to introduce a new approach to the problem that integrates discrete random walk-based techniques with continuous linear algebraic methods. We believe that our use of electrical networks and sparse linear system solvers in conjunction with random walks and combinatorial partitioning techniques is a useful paradigm that will find further applications in algorithmic graph theory. This work was done in collaboration with Jonathan Kelner.
by Aleksander Ma̧dry.
S.M.
APA, Harvard, Vancouver, ISO, and other styles
10

Selley, Gordon. "TWIGS - Trees and Woods Image Generation System." Thesis, Coventry University, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.305956.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Generating trees"

1

Noonan, Robert. An algorithm for generating abstract syntax trees. Hampton, Va: Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Society, European Mathematical, ed. Denumerable Markov chains: Generating functions, boundary theory, random walks on trees. Zürich, Switzerland: European Mathematical Society, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lin, Chijien. Generating forest stands with spatio-temporal dependencies. Joensuu: Joensuun yliopisto, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Alonso, Laurent, and René Schott. Random Generation of Trees. Boston, MA: Springer US, 1995. http://dx.doi.org/10.1007/978-1-4757-6353-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Dorrell, Linda. The trees of Eden: A novel. Grand Rapids, Mich: Revell, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Alonso, Laurent. Random Generation of Trees: Random Generators in Computer Science. Boston, MA: Springer US, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Alonso, Laurent. Random generation of trees: Random generators in computer science. Boston: Kluwer Academic, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Workshop on Advanced Generation Breeding, Current Status, and Research Needs (1984 Baton Rouge, La.). Advanced generation breeding of forest trees: Proceedings of a Workshop on Advanced Generation Breeding, Current Status and Research Needs June 6-7, 1984, Baton Rouge, Louisiana. [Baton Rouge]: Louisiana Agricultural Experiment Station, Louisiana State University Agricultural Center, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

1954-, Kolb Hans-Peter, and Mönnich Uwe 1939-, eds. The mathematics of syntactic structure: Trees and their logics. Berlin: M. de Gruyter, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Raik, Jaan. Hierarchical test generation for digital circuits represented by decision diagrams. Tallinn: Tallinn Technical University, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Generating trees"

1

Nakano, Shin-ichi, and Takeaki Uno. "Generating Colored Trees." In Graph-Theoretic Concepts in Computer Science, 249–60. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11604686_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zhuang, Bingbing, and Hiroshi Nagamochi. "Generating Trees on Multisets." In Algorithms and Computation, 182–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-17517-6_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Freund, Rudolf, Marion Oswald, and Andrei Păun. "P Systems Generating Trees." In Membrane Computing, 309–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-31837-8_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Overbey, Jeffrey L., and Ralph E. Johnson. "Generating Rewritable Abstract Syntax Trees." In Software Language Engineering, 114–33. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-00434-6_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Proskurowski, Andrzej, and Frank Ruskey. "Generating binary trees by transpositions." In SWAT 88, 199–207. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/3-540-19487-8_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Dümpelmann, Sonja. "Occupying public space, generating public spheres." In The Politics of Street Trees, 291–306. London: Routledge, 2022. http://dx.doi.org/10.4324/9781003054672-26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Merlini, D., R. Sprugnoli, and M. C. Verri. "An Algebra for Proper Generating Trees." In Mathematics and Computer Science, 127–39. Basel: Birkhäuser Basel, 2000. http://dx.doi.org/10.1007/978-3-0348-8405-1_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Lo, Ming-Ling, and Chinya V. Ravishankar. "Generating seeded trees from data sets." In Advances in Spatial Databases, 328–47. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60159-7_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Holmes, Geoffrey, Mark Hall, and Eibe Prank. "Generating Rule Sets from Model Trees." In Advanced Topics in Artificial Intelligence, 1–12. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-46695-9_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Rodionov, Alexey S., and Hyunseung Choo. "On Generating Random Network Structures: Trees." In Lecture Notes in Computer Science, 879–87. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-44862-4_95.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Generating trees"

1

Broder, A. "Generating random spanning trees." In 30th Annual Symposium on Foundations of Computer Science. IEEE, 1989. http://dx.doi.org/10.1109/sfcs.1989.63516.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Shibasaki, Satoshi, and Hideki Aoyama. "Development of Wood Grain Pattern Design System." In ASME 2009 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2009. http://dx.doi.org/10.1115/detc2009-87094.

Full text
Abstract:
Various approaches for generating woodgrain patterns using computer graphics have been proposed so far. However, the generation of various woodgrain patterns with conventional methods is difficult due to the need for the adjustment of numerous parameters to express a real woodgrain pattern. In this paper, a new mathematical approach for generating woodgrain patterns is proposed. Virtual trees are generated by simulating tree growing based on past actual weather information obtained from public organizations, and woodgrain patterns are then acquired by cutting the trunks of the virtual trees. In order to simulate tree growing, growth models of tree are constructed in consideration of dendrological characteristics and environmental conditions. Growth of tree is influenced by various environmental factors, such as sunlight, temperature, carbon dioxide concentration, wind, precipitation, soil nutrient, inclination of ground, survival amongst surrounding trees, etc. With this system, the growth model of trees is constructed based on precipitation, temperature, sunlight, and inclination of ground, which especially have strong effects on tree growth. With this approach, various types of virtual trees can be obtained by changing growth conditions such as period and location of growth without the need to reset complicated parameters of tree species, and then the virtual trees can be cut at arbitrary areas, thus allowing a variety of woodgrain patterns to be easily generated by one parameter setup.
APA, Harvard, Vancouver, ISO, and other styles
3

Xue, Xiaobing, and W. Bruce Croft. "Generating reformulation trees for complex queries." In the 35th international ACM SIGIR conference. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2348283.2348355.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Theiling, Henrik. "Generating Decision Trees for Decoding Binaries." In the 2001 ACM SIGPLAN workshop. New York, New York, USA: ACM Press, 2001. http://dx.doi.org/10.1145/384198.384213.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Theiling, Henrik. "Generating Decision Trees for Decoding Binaries." In the ACM SIGPLAN workshop. New York, New York, USA: ACM Press, 2001. http://dx.doi.org/10.1145/384197.384213.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Mori, Takuya, Satoshi Shibasaki, and Hideki Aoyama. "Development of System for High Quality Wood Grain Design." In ASME 2011 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2011. http://dx.doi.org/10.1115/detc2011-48892.

Full text
Abstract:
Various approaches for generating woodgrain patterns using computer graphics have been proposed so far. However, it is difficult to reproduce real woodgrain patterns using such conventional methods. In this paper, a new approach for generating woodgrain patterns is proposed. Virtual trees are generated by simulating tree growth in consideration of environmental conditions. Moreover, fine tree tissues and reflection properties at the wood surface are modeled. By applying these modeled factors, more diverse and accurate woodgrain patterns can be generated. With this approach, various types of virtual trees can be obtained by changing growth conditions such as period and location of growth or form of tissue in trees without the need to reset complicated parameters of each tree species. After this, the virtual trees can be cut at arbitrary areas, thus allowing a variety of woodgrain patterns to be generated by easy parameter setup.
APA, Harvard, Vancouver, ISO, and other styles
7

Qian, Yao, Hui Liang, and Frank K. Soong. "Generating natural F0 trajectory with additive trees." In Interspeech 2008. ISCA: ISCA, 2008. http://dx.doi.org/10.21437/interspeech.2008-551.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Li, Chuan, Oliver Deussen, Yi-Zhe Song, Phil Willis, and Peter Hall. "Modeling and generating moving trees from video." In the 2011 SIGGRAPH Asia Conference. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/2024156.2024161.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Nassar, Mohamed, Sylvain Martin, Guy Leduc, and Olivier Festor. "Using decision trees for generating adaptive SPIT signatures." In the 4th international conference. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/2070425.2070431.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Zhang, Le, Ye Ren, and P. N. Suganthan. "Towards generating random forests via extremely randomized trees." In 2014 International Joint Conference on Neural Networks (IJCNN). IEEE, 2014. http://dx.doi.org/10.1109/ijcnn.2014.6889537.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Generating trees"

1

Flaishman, Moshe, Herb Aldwinckle, Shulamit Manulis, and Mickael Malnoy. Efficient screening of antibacterial genes by juvenile phase free technology for developing resistance to fire blight in pear and apple trees. United States Department of Agriculture, December 2008. http://dx.doi.org/10.32747/2008.7613881.bard.

Full text
Abstract:
Objectives: The original objectives of this project were to: Produce juvenile-free pear and apple plants and examine their sensitivity to E. amylovora; Design novel vectors, for antibacterial proteins and promoters expression, combined with the antisense TFL1 gene, and transformation of Spadona pear in Israel and Galaxy apple in USA. The original objectives were revised from the development of novel vectors with antibacterial proteins combined with the TFL-1 due to the inefficiency of alternative markes initially evaluated in pear, phoshomannose-isomerase and 2-deoxyglucose-6-phosphate phosphatase and the lack of development of double selection system. The objectives of project were revised to focus primarily on the development additional juvenile free systems by the use of another pear variety and manipulation of the FT gene under the control of several promoters. Based on the results creation of fire blight resistance pear variety was developed by the use of the juvenile free transgenic plant. Background: Young tree seedlings are unable to initiate reproductive organs and require a long period of shoot maturation, known as juvenile phase. In pear, juvenile period can last 5-7 years and it causes a major delay in breeding programs. We isolated the TFL1 gene from Spadona pear (PcTFL1-1) and produced transgenic ‘Spadona’ trees silencing the PcTFL1 gene using a RNAi approach. Transgenic tissue culture ‘Spadona’ pear flowered in vitro. As expected, the expression of the endogenous PcTFL1 was suppressed in the transgenic line that showed precocious flowering. Transgenic plants were successfully rooted in the greenhouse and most of the plants flowered after only 4-8 months, whereas the non-transformed control plants have flowered only after 5-6 years of development. Major achievements: Prior to flower induction, transgenic TFL1-RNAi ‘Spadona’ plants developed a few branches and leaves. Flower production in the small trees suppressed the development of the vegetative branches, thus resulting in compact flowering trees. Flowering was initiated in terminal buds, as described for the Arabidopsis tfl1 mutant. Propagation of the transgenic TFL1-RNAi ‘Spadona’ was performed by bud grafting on 'Betulifolia' rootstock and resulted in compact flowering trees. The transgenic flowering grafted plants were grown in the greenhouse under a long photoperiod for one year, and flowered continuously. Pollination of the transgenic flowers with ‘Costia‘ pear pollen generated fruits of regular shape with fertile F1 seeds. The F1 transgenic seedling grown in the greenhouse formed shoots and produced terminal flowers only five months after germination. In addition, grafted F1 transgenic buds flower and fruit continuously, generating hybrid fruits with regular shape, color and taste. Several pear varieties were pollinated with the transgenic TFL1-RNAi ‘Spadona’ pollen including `Herald Harw` that was reported to have resistance to fire blight diseases. The F-1 hybrid seedlings currently grow in our greenhouse. We conclude that the juvenile-free transgenic ‘Spadona’ pear enables the development of a fast breeding method in pear that will enable us to generate a resistance pear to fire blight. Implications: The research supported by this grant has demonstrated the use of transgenic juvenile free technology in pear. The use of the juvenile free technology for enhancement of conventional breeding in fruit tree will serve to enhance fast breeding systems in pear and another fruit trees.
APA, Harvard, Vancouver, ISO, and other styles
2

Hart, Carl R., D. Keith Wilson, Chris L. Pettit, and Edward T. Nykaza. Machine-Learning of Long-Range Sound Propagation Through Simulated Atmospheric Turbulence. U.S. Army Engineer Research and Development Center, July 2021. http://dx.doi.org/10.21079/11681/41182.

Full text
Abstract:
Conventional numerical methods can capture the inherent variability of long-range outdoor sound propagation. However, computational memory and time requirements are high. In contrast, machine-learning models provide very fast predictions. This comes by learning from experimental observations or surrogate data. Yet, it is unknown what type of surrogate data is most suitable for machine-learning. This study used a Crank-Nicholson parabolic equation (CNPE) for generating the surrogate data. The CNPE input data were sampled by the Latin hypercube technique. Two separate datasets comprised 5000 samples of model input. The first dataset consisted of transmission loss (TL) fields for single realizations of turbulence. The second dataset consisted of average TL fields for 64 realizations of turbulence. Three machine-learning algorithms were applied to each dataset, namely, ensemble decision trees, neural networks, and cluster-weighted models. Observational data come from a long-range (out to 8 km) sound propagation experiment. In comparison to the experimental observations, regression predictions have 5–7 dB in median absolute error. Surrogate data quality depends on an accurate characterization of refractive and scattering conditions. Predictions obtained through a single realization of turbulence agree better with the experimental observations.
APA, Harvard, Vancouver, ISO, and other styles
3

Cohen, Yuval, Christopher A. Cullis, and Uri Lavi. Molecular Analyses of Soma-clonal Variation in Date Palm and Banana for Early Identification and Control of Off-types Generation. United States Department of Agriculture, October 2010. http://dx.doi.org/10.32747/2010.7592124.bard.

Full text
Abstract:
Date palm (Phoenix dactylifera L.) is the major fruit tree grown in arid areas in the Middle East and North Africa. In the last century, dates were introduced to new regions including the USA. Date palms are traditionally propagated through offshoots. Expansion of modern date palm groves led to the development of Tissue Culture propagation methods that generate a large number of homogenous plants, have no seasonal effect on plant source and provide tools to fight the expansion of date pests and diseases. The disadvantage of this procedure is the occurrence of off-type trees which differ from the original cultivar. In the present project we focused on two of the most common date palm off-types: (1) trees with reduced fruit setting, in which most of the flowers turn into three-carpel parthenocarpic fruits. In a severe form, multi-carpel flowers and fruitlets (with up to six or eight carpels instead of the normal three-carpel flowers) are also formed. (2) dwarf trees, having fewer and shorter leaves, very short trunk and are not bearing fruits at their expected age, compared to the normal trees. Similar off-types occur in other crop species propagated by tissue culture, like banana (mainly dwarf plants) or oil palm (with a common 'Mantled' phenotype with reduced fruit setting and occurrence of supernumerary carpels). Some off-types can only be detected several years after planting in the fields. Therefore, efficient methods for prevention of the generation of off-types, as well as methods for their detection and early removal, are required for date palms, as well as for other tissue culture propagated crops. This research is aimed at the understanding of the mechanisms by which off-types are generated, and developing markers for their early identification. Several molecular and genomic approaches were applied. Using Methylation Sensitive AFLP and bisulfite sequencing, we detected changes in DNA methylation patterns occurring in off-types. We isolated and compared the sequence and expression of candidate genes, genes related to vegetative growth and dwarfism and genes related to flower development. While no sequence variation were detected, changes in gene expression, associated with the severity of the "fruit set" phenotype were detected in two genes - PdDEF (Ortholog of rice SPW1, and AP3 B type MADS box gene), and PdDIF (a defensin gene, highly homologous to the oil palm gene EGAD). We applied transcriptomic analyses, using high throughput sequencing, to identify genes differentially expressed in the "palm heart" (the apical meristem and the region of embryonic leaves) of dwarf vs. normal trees. Among the differentially expressed genes we identified genes related to hormonal biosynthesis, perception and regulation, genes related to cell expansion, and genes related to DNA methylation. Using Representation Difference Analyses, we detected changes in the genomes of off-type trees, mainly chloroplast-derived sequences that were incorporated in the nuclear genome and sequences of transposable elements. Sequences previously identified as differing between normal and off-type trees of oil palms or banana, successfully identified variation among date palm off-types, suggesting that these represent highly labile regions of monocot genomes. The data indicate that the date palm genome, similarly to genomes of other monocot crops as oil palm and banana, is quite unstable when cells pass through a cycle of tissue culture and regeneration. Changes in DNA sequences, translocation of DNA fragments and alteration of methylation patterns occur. Consequently, patterns of gene expression are changed, resulting in abnormal phenotypes. The data can be useful for future development of tools for early identification of off-type as well as for better understanding the phenomenon of somaclonal variation during propagation in vitro.
APA, Harvard, Vancouver, ISO, and other styles
4

NORMAN, E. C. Acceptance Test Plan for Fourth-Generation Hanford Corrosion Probe Tree Assembly. Office of Scientific and Technical Information (OSTI), October 2000. http://dx.doi.org/10.2172/805388.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Marcos Morezuelas, Paloma. Gender, Forests and Climate Change. Inter-American Development Bank, March 2021. http://dx.doi.org/10.18235/0003072.

Full text
Abstract:
As users of forest products and guardians of traditional knowledge, women have always been involved in forestry. Nevertheless, their access to forest resources and benefits and participation in forest management is limited compared to mens despite the fact that trees are more important to women, who depend on them for their families food security, income generation and cooking fuel. This guide aims to facilitate the incorporation of a gender lens in climate change mitigation and adaptation operations in forests, with special attention to those framed in REDD. This guide addresses four themes value chains, environmental payment schemes, firewood and biodiversity that relate directly to 1) how climate change impacts affect women in the forest and 2) how mitigation and adaptation measures affect womens access to resources and benefits distribution.
APA, Harvard, Vancouver, ISO, and other styles
6

Majd, Farjam. Two new parallel processors for real time classification of 3-D moving objects and quad tree generation. Portland State University Library, January 2000. http://dx.doi.org/10.15760/etd.5301.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bar-Joseph, Moshe, William O. Dawson, and Munir Mawassi. Role of Defective RNAs in Citrus Tristeza Virus Diseases. United States Department of Agriculture, September 2000. http://dx.doi.org/10.32747/2000.7575279.bard.

Full text
Abstract:
This program focused on citrus tristeza virus (CTV), the largest and one of the most complex RNA-plant-viruses. The economic importance of this virus to the US and Israeli citrus industries, its uniqueness among RNA viruses and the possibility to tame the virus and eventually turn it into a useful tool for the protection and genetic improvement of citrus trees justify these continued efforts. Although the overall goal of this project was to study the role(s) of CTV associated defective (d)-RNAs in CTV-induced diseases, considerable research efforts had to be devoted to the engineering of the helper virus which provides the machinery to allow dRNA replication. Considerable progress was made through three main lines of complementary studies. For the first time, the generation of an engineered CTV genetic system that is capable of infecting citrus plants with in vitro modified virus was achieved. Considering that this RNA virus consists of a 20 kb genome, much larger than any other previously developed similar genetic system, completing this goal was an extremely difficult task that was accomplished by the effective collaboration and complementarity of both partners. Other full-length genomic CTV isolates were sequenced and populations examined, resulting in a new level of understanding of population complexities and dynamics in the US and Israel. In addition, this project has now considerably advanced our understanding and ability to manipulate dRNAs, a new class of genetic elements of closteroviruses, which were first found in the Israeli VT isolate and later shown to be omnipresent in CTV populations. We have characterized additional natural dRNAs and have shown that production of subgenomic mRNAs can be involved in the generation of dRNAs. We have molecularly cloned natural dRNAs and directly inoculated citrus plants with 35S-cDNA constructs and have shown that specific dRNAs are correlated with specific disease symptoms. Systems to examine dRNA replication in protoplasts were developed and the requirements for dRNA replication were defined. Several artificial dRNAs that replicate efficiently with a helper virus were created from infectious full-genomic cDNAs. Elements that allow the specific replication of dRNAs by heterologous helper viruses also were defined. The T36-derived dRNAs were replicated efficiently by a range of different wild CTV isolates and hybrid dRNAs with heterologous termini are efficiently replicated with T36 as helper. In addition we found: 1) All CTV genes except of the p6 gene product from the conserved signature block of the Closteroviridae are obligate for assembly, infectivity, and serial protoplast passage; 2) The p20 protein is a major component of the amorphous inclusion bodies of infected cells; and 3) Novel 5'-Co-terminal RNAs in CTV infected cells were characterized. These results have considerably advanced our basic understanding of the molecular biology of CTV and CTV-dRNAs and form the platform for the future manipulation of this complicated virus. As a result of these developments, the way is now open to turn constructs of this viral plant pathogen into new tools for protecting citrus against severe CTV terms and development of virus-based expression vectors for other citrus improvement needs. In conclusion, this research program has accomplished two main interconnected missions, the collection of basic information on the molecular and biological characteristics of the virus and its associated dRNAs toward development of management strategies against severe diseases caused by the virus and building of novel research tools to improve citrus varieties. Reaching these goals will allow us to advance this project to a new phase of turning the virus from a pathogen to an ally.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Generating trees' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography