Relevant bibliographies by topics / Rooted tree

Contents

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

Academic literature on the topic 'Rooted tree'

Author: Grafiati
Published: 17 February 2024

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 'Rooted tree.'

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 "Rooted tree"

1

Tanaka, Tatsushi. "Rooted tree maps." Communications in Number Theory and Physics 13, no. 3 (2019): 647–66. http://dx.doi.org/10.4310/cntp.2019.v13.n3.a6.

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

Béal, Sylvain, Eric Rémila, and Philippe Solal. "Rooted-tree solutions for tree games." European Journal of Operational Research 203, no. 2 (June 2010): 404–8. http://dx.doi.org/10.1016/j.ejor.2009.07.023.

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

Fumuro, Masahiko. "Comparison of Growth, Yield, and Fruit Quality of Pot-planted Mango cv. Aikou Using Own-rooted Trees Propagated by Air Layering and Grafted Trees Propagated by Conventional Methods." HortScience 54, no. 7 (July 2019): 1175–80. http://dx.doi.org/10.21273/hortsci13984-19.

Full text
Abstract:
To determine the potential of using own-rooted trees to lower tree height and delay the decline in tree vigor caused by root clogging, the growth, yield, and fruit quality of pot-planted ‘Aikou’ mango (Mangifera indica L.) trees propagated by air layering and grafting were observed for 8 years after planting. The trunk diameter of the own-rooted trees propagated by air layering (hereafter abbreviated as own-rooted trees) was significantly smaller than that of the grafted trees propagated by conventional methods (hereafter abbreviated as grafted trees), but there were no significant differences in the scion diameters of the grafted trees. Moreover, no significant differences were observed in leaf number or total length of green branches between the own-rooted and grafted trees during the final 3 years. The height of the own-rooted trees was significantly shorter than that of the grafted trees. Although no difference in the fresh or dry weight of the aboveground part and whole tree was observed between the own-rooted and grafted trees, the fresh and dry weights of the underground part of the own-rooted trees were significantly lower than those of the grafted trees. Furthermore, the T-R ratio (the weight of the aboveground part of the tree excluding the leaves/the weight of the underground part of the tree) of the own-rooted trees was significantly higher than that of the grafted trees. Overall, no significant differences in yield or fruit quality were observed between the two tree types, and the average yield per 1 m2 over 6 years was 2.9–3.1 kg. These results indicate that it may be possible to lower tree height, delay the decline in tree vigor caused by root clogging, and prolong the life span of pot-planted trees by using own-rooted trees.
APA, Harvard, Vancouver, ISO, and other styles
4

GAWRON, PIOTR W., VOLODYMYR V. NEKRASHEVYCH, and VITALY I. SUSHCHANSKY. "CONJUGATION IN TREE AUTOMORPHISM GROUPS." International Journal of Algebra and Computation 11, no. 05 (October 2001): 529–47. http://dx.doi.org/10.1142/s021819670100070x.

Full text
Abstract:
It is given a full description of conjugacy classes in the automorphism group of the locally finite tree and of a rooted tree. They are characterized by their types (a labeled rooted trees) similar to the cyclical types of permutations. We discuss separately the case of a level homogenous tree, i.e. conjugality in wreath products of infinite sequences of symmetric groups. It is proved those automorphism groups of rooted and homogenous non-rooted trees are ambivalent.
APA, Harvard, Vancouver, ISO, and other styles
5

Mastakas, Konstantinos. "Drawing a rooted tree as a rooted y−monotone minimum spanning tree." Information Processing Letters 166 (February 2021): 106035. http://dx.doi.org/10.1016/j.ipl.2020.106035.

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

HE, YING-JUN, TRINH N. D. HUYNH, JESPER JANSSON, and WING-KIN SUNG. "INFERRING PHYLOGENETIC RELATIONSHIPS AVOIDING FORBIDDEN ROOTED TRIPLETS." Journal of Bioinformatics and Computational Biology 04, no. 01 (February 2006): 59–74. http://dx.doi.org/10.1142/s0219720006001709.

Full text
Abstract:
To construct a phylogenetic tree or phylogenetic network for describing the evolutionary history of a set of species is a well-studied problem in computational biology. One previously proposed method to infer a phylogenetic tree/network for a large set of species is by merging a collection of known smaller phylogenetic trees on overlapping sets of species so that no (or as little as possible) branching information is lost. However, little work has been done so far on inferring a phylogenetic tree/network from a specified set of trees when in addition, certain evolutionary relationships among the species are known to be highly unlikely. In this paper, we consider the problem of constructing a phylogenetic tree/network which is consistent with all of the rooted triplets in a given set [Formula: see text] and none of the rooted triplets in another given set [Formula: see text]. Although NP-hard in the general case, we provide some efficient exact and approximation algorithms for a number of biologically meaningful variants of the problem.
APA, Harvard, Vancouver, ISO, and other styles
7

Lu, Pengxin, Wayne Bell, Paul Charrette, and Megan Thompson. "Performance of jack pine (Pinus banksiana) rooted cuttings from proliferated dwarf shoots versus seedlings 8 years after planting." Canadian Journal of Forest Research 42, no. 7 (July 2012): 1404–9. http://dx.doi.org/10.1139/x2012-079.

Full text
Abstract:
Growth and tree form characteristics of jack pine (Pinus banksiana Lamb.) rooted cuttings propagated from proliferated dwarf shoots (PDS) were compared with seedlings in two field trials 8 years after establishment. Results indicated that jack pine rooted cuttings from PDS can grow as well as seedlings and maintain acceptable tree form. Rooted cuttings of progeny from the 22 top-ranking open-pollinated families in a seedling seed orchard of jack pine were 4.2% taller and 10% larger in diameter at breast height than commercial seedlings tested on the same sites, which indicates that rooted cuttings have potential in realizing genetic gains in jack pine tree improvement programs. Rooted cuttings increased the proportion of trees with normal branching characteristics and reduced the percentage of trees with excessive heavy branches in the Sault St. Marie trial, which had larger tree sizes. However, longer term monitoring (20 to 25 years) is needed to determine stability of jack pine rooted cuttings planted on sandy soil where wind throw may become a problem as tree size increases.
APA, Harvard, Vancouver, ISO, and other styles
8

Abdulcarim, Normalah Sharief, and Susan C. Dagondon. "On the Independent Neighborhood Polynomial of the Rooted Product of Two Trees." European Journal of Pure and Applied Mathematics 15, no. 1 (January 31, 2022): 64–81. http://dx.doi.org/10.29020/nybg.ejpam.v15i1.4220.

Full text
Abstract:
Let G be a connected graph. We say that a given graph is a tree if every pair ofvertices is connected by a unique path. The rooted product of two trees is relevant to tree, as the obtained product is another tree. In this paper, we establish the independent neighborhood sets of a tree and obtain its corresponding independent neighborhood polynomial. Furthermore, the independent neighborhood polynomial of the rooted product of two trees were determine using their independent neighborhood sets.
APA, Harvard, Vancouver, ISO, and other styles
9

Tsipouridis, C. G., A. Isaakidis, A. Manganaris, I. Therios, and Z. Michailidis. "Propagation and field performance of own-rooted peach trees." Australian Journal of Experimental Agriculture 44, no. 12 (2004): 1225. http://dx.doi.org/10.1071/ea02062.

Full text
Abstract:
Ten peach and nectarine (Prunus persica L. Batsh) cultivars: Arm King, Early Crest, Early Gem, Flavor Crest, May Crest, May Grand, Red Gold, Red Haven, Spring Crest and Sun Crest, were propagated by both hardwood cuttings (HC) and by bud grafting onto peach seedlings. Significant differences were observed for rooting among cultivars and applied IBA. Degree of blooming and yield were higher for HC propagated own-rooted trees when compared with budded trees in the first 6 years of fruiting. Budded trees increased in size faster than HC trees but were less productive. Yield, yield efficiency and fruit size were not only cultivar specific, but were also affected by the propagation method, being higher for own-rooted trees in most cultivars. Tree mortality was generally higher for budded trees. No significant differences were found in mineral absorption efficiency, time of blooming, fruit firmness, acidity and sugar level between own-rooted and budded trees. Results based on percent rooting of HC, yield, fruit size, growth and tree mortality suggest that own-rooted HC trees should be an acceptable tree type for commercial orchards, especially for the cultivars Sun Crest, Spring Crest and Red Haven.
APA, Harvard, Vancouver, ISO, and other styles
10

Takacs, Lajos. "On the total heights of random rooted trees." Journal of Applied Probability 29, no. 3 (September 1992): 543–56. http://dx.doi.org/10.2307/3214892.

Full text
Abstract:
Denote by Sn the set of all distinct rooted trees with n labeled vertices. Define τn as the total height of a tree chosen at random in the set Sn, assuming that all the possible nn–1 choices are equally probable. The total height of a tree is defined as the sum of the heights of its vertices. The height of a vertex in a rooted tree is the distance from the vertex to the root of the tree, that is, the number of edges in the path from the vertex to the root. This paper is concerned with the distribution and the moments of τn and their asymptotic behavior as n → ∞.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Rooted tree"

1

Hunt, Ailsa Gaynor. "Rooted in religion : the Roman sacred tree." Thesis, University of Cambridge, 2013. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.608102.

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

Zhao, Jinhua. "Maximum Bounded Rooted-Tree Problem : Algorithms and Polyhedra." Thesis, Université Clermont Auvergne‎ (2017-2020), 2017. http://www.theses.fr/2017CLFAC044/document.

Full text
Abstract:
Étant donnés un graphe simple non orienté G = (V, E) et un sommet particulier r dans V appelé racine, un arbre enraciné, ou r-arbre, de G est soit le graphe nul soit un arbre contenant r. Si un vecteur de capacités sur les sommets est donné, un sous-graphe de G est dit borné si le degré de chaque sommet dans le sous-graphe est inférieur ou égal à sa capacité. Soit w un vecteur de poids sur les arêtes et p un vecteur de profits sur les sommets. Le problème du r-arbre borné maximum (MBrT, de l’anglais Maximum Bounded r-Tree) consiste à trouver un r-arbre borné T = (U, F) de G tel que son poids soit maximisé. Si la contrainte de capacité du problème MBrT est relâchée, nous obtenons le problème du r-arbre maximum (MrT, de l’anglais Maximum r-Tree). Cette thèse contribue à l’étude des problèmes MBrT et MrT.Tout d’abord, ces deux problèmes sont formellement définis et leur complexité est étudiée. Nous présentons ensuite des polytopes associés ainsi qu’une formulation pour chacun d’entre eux. Par la suite, nous proposons plusieurs algorithmes combinatoires pour résoudre le problème MBrT (et donc le problème MrT) en temps polynomial sur les arbres, les cycles et les cactus. En particulier, un algorithme de programmation dynamique est utilisé pour résoudre le problème MBrT sur les arbres. Pour les cycles, nous sommes amenés a considérer trois cas différents pour lesquels le problem MBrT se réduit à certains problèmes polynomiaux. Pour les cactus, nous montrons tout d’abord que le problème MBrT peut être résolu en temps polynomial sur un type de graphes appelé cactus basis. En utilisant une série de décompositions en sous-problèmes sur les arbres et les cactus basis, nous obtenons un algorithme pour les graphes de type cactus.La deuxième partie de ce travail étudie la structure polyédrale de trois polytopes associés aux problèmes MBrT et MrT. Les deux premiers polytopes, Bxy(G,r,c) et Bx(G,r,c) sont associés au problème MBrT. Tous deux considèrent des variables sur les arêtes de G, mais seuls Bxy(G,r,c) possède également des variables sur les sommets de G. Le troisième polytope, Rx(G,r), est associé au problème MrT et repose uniquement sur les variables sur les arêtes. Pour chacun de ces trois polytopes, nous étudions sa dimension, caractérisons certaines inégalités définissant des facettes, et présentons les moyens possibles de décomposition. Nous introduisons également de nouvelles familles de contraintes. L’ajout de ces contraintes nous permettent de caractériser ces trois polytopes dans plusieurs classes de graphes.Pour finir, nous étudions les problèmes de séparation pour toutes les inégalités que nous avons trouvées jusqu’ici. Des algorithmes polynomiaux de séparation sont présentés, et lorsqu’un problème de séparation est NP-difficile, nous donnons des heuristiques de séparation. Tous les résultats théoriques développés dans ce travail sont implémentés dans plusieurs algorithmes de coupes et branchements auxquels une matheuristique est également jointe pour générer rapidement des solutions réalisables. Des expérimentations intensives ont été menées via le logiciel CPLEX afin de comparer les formulations renforcées et originales. Les résultats obtenus montrent de manière convaincante la force des formulations renforcées
Given a simple undirected graph G = (V, E) with a so-called root node r in V, a rooted tree, or an r-tree, of G is either the empty graph, or a tree containing r. If a node-capacity vector c is given, then a subgraph of G is said to be bounded if the degree of each node in the subgraph does not exceed its capacity. Let w be an edge-weight vector and p a node-price vector. The Maximum Bounded r-Tree (MBrT) problem consists of finding a bounded r-tree T = (U, F) of G such that its weight is maximized. If the capacity constraint from the MBrT problem is relaxed, we then obtain the Maximum r-Tree (MrT) problem. This dissertation contributes to the study of the MBrT problem and the MrT problem.First we introduce the problems with their definitions and complexities. We define the associated polytopes along with a formulation for each of them. We present several polynomial-time combinatorial algorithms for both the MBrT problem (and thus the MrT problem) on trees, cycles and cactus graphs. Particularly, a dynamic-programming-based algorithm is used to solve the MBrT problem on trees, whereas on cycles we reduce it to some polynomially solvable problems in three different cases. For cactus graphs, we first show that the MBrT problem can be solved in polynomial time on a so-called cactus basis, then break down the problem on any cactus graph into a series of subproblems on trees and on cactus basis.The second part of this work investigates the polyhedral structure of three polytopes associated with the MBrT problem and the MrT problem, namely Bxy(G, r, c), Bx(G, r, c) and Rx(G, r). Bxy(G, r, c) and Bx(G, r, c) are polytopes associated with the MBrT problem, where Bxy(G, r, c) considers both edge- and node-indexed variables and Bx(G, r, c) considers only edge-indexed variables. Rx(G, r) is the polytope associated with the MrT problem that only considers edge-indexed variables. For each of the three polytopes, we study their dimensions, facets as well as possible ways of decomposition. We introduce some newly discovered constraints for each polytope, and show that these new constraints allow us to characterize them on several graph classes. Specifically, we provide characterization for Bxy (G, r, c) on cactus graphs with the help of a decomposition through 1-sum. On the other hand, a TDI-system that characterizes Bx(G,r,c) is given in each case of trees and cycles. The characterization of Rx(G,r) on trees and cycles then follows as an immediate result.Finally, we discuss the separation problems for all the inequalities we have found so far, and present algorithms or cut-generation heuristics accordingly. A couple of branch-and-cut frameworks are implemented to solve the MBrT problem together with a greedy-based matheuristic. We compare the performances of the enhanced formulations with the original formulations through intensive computational test, where the results demonstrate convincingly the strength of the enhanced formulations
APA, Harvard, Vancouver, ISO, and other styles
3

Snook, Michael James. "Evolution of Tandemly Repeated Sequences." Thesis, University of Canterbury. Mathematics & Statistics, 2009. http://hdl.handle.net/10092/2661.

Full text
Abstract:
Despite being found in all presently sequenced genomes, the evolution of tandemly repeated sequences has only just begun to be understood. We can represent the duplication history of tandemly repeated sequences with duplication trees. Most phylogenetic techniques need to be modified to be used on duplication trees. Due to gene loss, it is not always possible to reconstruct the duplication history of a tandemly repeated sequence. This thesis addresses this problem by providing a polynomial-time locally optimal algorithm to reconstruct the duplication history of a tandemly repeated sequence in the presence of gene loss. Supertree methods cannot be directly applied to duplication trees. A polynomial-time algorithm that takes a forest of ordered phylogenies and looks for a super duplication tree is presented. If such a super duplication tree is found then the algorithm constructs the super duplication tree. However, the algorithm does not always find a super duplication tree when one exists. The SPR topological rearrangement in its current form cannot be used on duplication trees. The necessary modifications are made to an agreement forest so that the SPR operation can be used on duplication trees. This operation is called the duplication rooted subtree prune and regraft operation (DrSPR). The size of the DrSPR neighbourhood is calculated for simple duplication trees and the tree shapes that maximize and minimize this are given.
APA, Harvard, Vancouver, ISO, and other styles
4

Jax, Tim [Verfasser]. "A Rooted-Tree Based Derivation of ROW-Type Methods with Non-Exact Jacobian Entries for Index-One DAEs / Tim Jax." Wuppertal : Universitätsbibliothek Wuppertal, 2020. http://d-nb.info/1214389651/34.

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

Silva, Pryscilla dos Santos Ferreira. "A post-Lie operad of rooted trees." Universidade de São Paulo, 2018. http://www.teses.usp.br/teses/disponiveis/55/55135/tde-10102018-164231/.

Full text
Abstract:
In this thesis we propose a description of the operad defining post-Lie algebras in terms of rooted trees and we discuss some applications of such a construction. In particular, we re-derive both the free post-Lie algebra defined in [22] and the main result of the paper [8]. Furthermore, a possible extension of the concept of symmetric brace algebra to the category of the post-Lie algebras is proposed.
Nessa tese propomos a descrição da operad que define as álgebras pós-Lie em termos de árvores enraizadas e discutimos algumas aplicações dessa construção. Em particular, nós obtemos novamente a álgebra pós-Lie livre definida em [22] e o resultado principal do artigo [8]. Além disso, uma possível extensão do conceito de álgebra brace simétrica à categoria de álgebras pós-Lie é apresentada.
APA, Harvard, Vancouver, ISO, and other styles
6

Artemenko, Igor. "On Weak Limits and Unimodular Measures." Thèse, Université d'Ottawa / University of Ottawa, 2014. http://hdl.handle.net/10393/30417.

Full text
Abstract:
In this thesis, the main objects of study are probability measures on the isomorphism classes of countable, connected rooted graphs. An important class of such measures is formed by unimodular measures, which satisfy a certain equation, sometimes referred to as the intrinsic mass transport principle. The so-called law of a finite graph is an example of a unimodular measure. We say that a measure is sustained by a countable graph if the set of rooted connected components of the graph has full measure. We demonstrate several new results involving sustained unimodular measures, and provide thorough arguments for known ones. In particular, we give a criterion for unimodularity on connected graphs, deduce that connected graphs sustain at most one unimodular measure, and prove that unimodular measures sustained by disconnected graphs are convex combinations. Furthermore, we discuss weak limits of laws of finite graphs, and construct counterexamples to seemingly reasonable conjectures.
APA, Harvard, Vancouver, ISO, and other styles
7

Gebhard, Madison. "Relationships Within the Family Tree: Roots of Recidivism." Scholarship @ Claremont, 2016. http://scholarship.claremont.edu/cmc_theses/1237.

Full text
Abstract:
This paper seeks to examine the correlation between family relations and habitual criminal activity. Building on previous research analyzing the power and influence of positive family environments on criminal behavior, I studied the effect of parent-child relationships as determinants of adult recidivism. My results corresponded with previous studies and implied a direct correlation between positive relationships and recidivism reduction. Furthermore, my findings support the research illustrating the effect of a person's family criminal history, level of education, and socioeconomic status on criminal behavior, which may ultimately have an effect on these influential ties between parents and children.
APA, Harvard, Vancouver, ISO, and other styles
8

Telewski, Frank W. "Determining the Germination Date of Woody Plants: A Proposed Method for Locating the Root/Shoot Interface." Tree-Ring Society, 1993. http://hdl.handle.net/10150/262369.

Full text
Abstract:
A method for determining the germination dates of trees is based on wood anatomical characteristics and dendrochronology. This procedure requires destructive sampling of the tree for an extensive analysis of the zone between the roots and the trunk of the tree (root/shoot interface). The method is applicable to forest ecology and woody plant life history studies.
APA, Harvard, Vancouver, ISO, and other styles
9

Bello, Jason. "Cyclic Particle Systems on Finite Graphs and Cellular Automata on Rooted, Regular Trees and Galton-Watson Trees." The Ohio State University, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=osu1618833498993715.

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

Van, Vleck Teresa. "Ground penetrating radar in tree root detection /." Connect to resource, 1999. http://hdl.handle.net/1811/28577.

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

Books on the topic "Rooted tree"

1

Rooted together: A mother and daughter rite of passage. Michigan]: Moore Publishing, 2014.

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

McMinn, R. G. Development of planting tool for long-rooted seedlings to optimize inverted humus mound performance. [Victoria, B.C.]: Forestry Canada, 1990.

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

Bass, Hyman, Maria Victoria Otero-Espinar, Daniel Rockmore, and Charles Tresser. Cyclic Renormalization and Automorphism Groups of Rooted Trees. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0096321.

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

1932-, Bass Hyman, ed. Cyclic renormalization and automorphism groups of rooted trees. Berlin: Springer-Verlag, 1996.

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

ill, Klise M. Sarah, ed. Regarding the trees: A splintered saga rooted in secrets. Orlando, Fla: Harcourt Inc., 2005.

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

Klise, Kate. Regarding the trees: A splintered saga rooted in secrets. Orlando, Fla: Harcourt Inc., 2005.

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

C, Farmer M., and Cutler D. F. 1939-, eds. Tree root plate morphology. [Bicester, Eng.]: A B Academic Publishers, Arboricultural Association, 1990.

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

Gingras, Benoit-Marie. Bilan du développement des récipients à parois ajourées: Culture des semis en pépinière et performance en plantation comparative. [Sainte-Foy]: Ministère des ressources naturelles, Forêt Québec, Direction de la recherche forestière, 1999.

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

Great Britain. Department of the Environment. and Construction Research Communications Ltd, eds. Damage to buildings caused by trees. London: Construction Research Communications, 1996.

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

Rietveld, W. J. An integrated technique for evaluating root growth potential of tree seedlings. [Fort Collins, Colo.]: USDA Forest Service, Rocky Mountain Forest and Range Experiment Station, 1990.

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

Book chapters on the topic "Rooted tree"

1

Fischer, Mareike, Lina Herbst, Sophie Johanna Kersting, Annemarie Luise Kühn, and Kristina Wicke. "Rooted quartet index." In Tree Balance Indices, 231–39. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-39800-1_20.

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

Hilfinger, P., E. Lawler, and G. Rote. "Flattening a rooted tree." In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 335–40. Providence, Rhode Island: American Mathematical Society, 1991. http://dx.doi.org/10.1090/dimacs/004/26.

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

Pan, Pengxiang, Junran Lichen, Ping Yang, and Jianping Li. "The Heterogeneous Rooted Tree Cover Problem." In Lecture Notes in Computer Science, 94–105. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-49193-1_8.

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

Tabatabaee, Yasamin, Sébastien Roch, and Tandy Warnow. "Statistically Consistent Rooting of Species Trees Under the Multispecies Coalescent Model." In Lecture Notes in Computer Science, 41–57. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-29119-7_3.

Full text
Abstract:
AbstractRooted species trees are used in several downstream applications of phylogenetics. Most species tree estimation methods produce unrooted trees and additional methods are then used to root these unrooted trees. Recently, Quintet Rooting (QR) (Tabatabaee et al., ISMB and Bioinformatics 2022), a polynomial-time method for rooting an unrooted species tree given unrooted gene trees under the multispecies coalescent, was introduced. QR, which is based on a proof of identifiability of rooted 5-taxon trees in the presence of incomplete lineage sorting, was shown to have good accuracy, improving over other methods for rooting species trees when incomplete lineage sorting was the only cause of gene tree discordance, except when gene tree estimation error was very high. However, the statistical consistency of QR was left as an open question. Here, we present QR-STAR, a polynomial-time variant of QR that has an additional step for determining the rooted shape of each quintet tree. We prove that QR-STAR is statistically consistent under the multispecies coalescent model, and our simulation study shows that QR-STAR matches or improves on the accuracy of QR. QR-STAR is available in open source form at https://github.com/ytabatabaee/Quintet-Rooting.
APA, Harvard, Vancouver, ISO, and other styles
5

Yamazaki, Tomoya, Akihiro Yamamoto, and Tetsuji Kuboyama. "Tree PCA for Extracting Dominant Substructures from Labeled Rooted Trees." In Discovery Science, 316–23. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-24282-8_27.

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

Ferro, A., M. Gefell, R. Kjelgren, D. S. Lipson, N. Zollinger, and S. Jackson. "Maintaining Hydraulic Control Using Deep Rooted Tree Systems." In Phytoremediation, 125–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-45991-x_5.

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

Zaki, Mohammed. "Unified Approach to Rooted Tree Mining: Algorithms and Applications." In Mining Graph Data, 381–410. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2006. http://dx.doi.org/10.1002/9780470073049.ch15.

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

Zhou, Jiang, and Peng Zhang. "Simple Heuristics for the Rooted Max Tree Coverage Problem." In Combinatorial Optimization and Applications, 252–64. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-49611-0_18.

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

Guillemot, Sylvain, Jesper Jansson, and Wing-Kin Sung. "Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets." In Algorithms and Computation, 1205–14. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10631-6_121.

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

Chen, Lin, and Daniel Marx. "Covering a tree with rooted subtrees – parameterized and approximation algorithms." In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2801–20. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2018. http://dx.doi.org/10.1137/1.9781611975031.178.

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

Conference papers on the topic "Rooted tree"

1

Hang, Xiaoshu, He Huang, and Fanlun Xiong. "General rooted tree drawing algorithm." In Second International Conference on Image and Graphics, edited by Wei Sui. SPIE, 2002. http://dx.doi.org/10.1117/12.477110.

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

Mayhew, Gregory L. "Rooted tree graphs and de Bruijn graphs." In 2010 IEEE Aerospace Conference. IEEE, 2010. http://dx.doi.org/10.1109/aero.2010.5446922.

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

Yi, Shengwei, Jize Xu, Yong Peng, Qi Xiong, Ting Wang, and Shilong Ma. "Mining Frequent Rooted Ordered Tree Generators Efficiently." In 2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC). IEEE, 2013. http://dx.doi.org/10.1109/cyberc.2013.29.

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

Schulz, Hans-Jorg, Zabedul Akbar, and Frank Maurer. "A generative layout approach for rooted tree drawings." In 2013 IEEE Pacific Visualization Symposium (PacificVis). IEEE, 2013. http://dx.doi.org/10.1109/pacificvis.2013.6596149.

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

Saynez, Akram Shehadi, Maria Josefa Somodevilla, Manuel Martin Ortiz, and Ivo H. Pineda. "H-Tree: A data structure for fast path-retrieval in rooted trees." In Eighth Mexican International Conference on Current Trends in Computer Science (ENC 2007). IEEE, 2007. http://dx.doi.org/10.1109/enc.2007.26.

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

Saynez, Akram Shehadi, Maria Josefa Somodevilla, Manuel Martin Ortiz, and Ivo H. Pineda. "H-Tree: A data structure for fast path-retrieval in rooted trees." In Eighth Mexican International Conference on Current Trends in Computer Science (ENC 2007). IEEE, 2007. http://dx.doi.org/10.1109/enc.2007.4351421.

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

Guojin Cong and D. A. Bader. "The Euler tour technique and parallel rooted spanning tree." In International Conference on Parallel Processing, 2004. ICPP 2004. IEEE, 2004. http://dx.doi.org/10.1109/icpp.2004.1327954.

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

Byrenheid, Martin, Stefanie Roos, and Thorsten Strufe. "Topology Inference of Networks utilizing Rooted Spanning Tree Embeddings." In ICDCN '22: 23rd International Conference on Distributed Computing and Networking. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3491003.3491020.

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

Chang, Ye-In, Chen-Chang Wu, Jun-Hong Shen, and Chien-Hung Chen. "Data Classification Based on the Class-Rooted FP-Tree Approach." In 2009 International Conference on Complex, Intelligent and Software Intensive Systems (CISIS). IEEE, 2009. http://dx.doi.org/10.1109/cisis.2009.160.

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

Wansong Zhang, Daxin Liu, and Jianpei Zhang. "Mining frequent rooted subtrees in XML data with Me-Tree." In 2004 IEEE Systems and Information Engineering Design Symposium. IEEE, 2004. http://dx.doi.org/10.1109/sieds.2004.239908.

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

Reports on the topic "Rooted tree"

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

Quillen, Brian G. Democracy - A Tree Without Roots on the Steppes of Central Asia. Fort Belvoir, VA: Defense Technical Information Center, December 2006. http://dx.doi.org/10.21236/ada462623.

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

Loehle, C., and R. Jones. Adaptive significance of root grafting in trees. Office of Scientific and Technical Information (OSTI), December 1988. http://dx.doi.org/10.2172/353384.

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

Zhang, Xingyu, Matteo Ciantia, Jonathan Knappett, and Anthony Leung. Micromechanical study of potential scale effects in small-scale modelling of sinker tree roots. University of Dundee, December 2021. http://dx.doi.org/10.20933/100001235.

Full text
Abstract:
When testing an 1:N geotechnical structure in the centrifuge, it is desirable to choose a large scale factor (N) that can fit the small-scale model in a model container and avoid unwanted boundary effects, however, this in turn may cause scale effects when the structure is overscaled. This is more significant when it comes to small-scale modelling of sinker root-soil interaction, where root-particle size ratio is much lower. In this study the Distinct Element Method (DEM) is used to investigate this problem. The sinker root of a model root system under axial loading was analysed, with both upward and downward behaviour compared with the Finite Element Method (FEM), where the soil is modelled as a continuum in which case particle-size effects are not taken into consideration. Based on the scaling law, with the same prototype scale and particle size distribution, different scale factors/g-levels were applied to quantify effects of the ratio of root diameter (𝑑𝑟) to mean particle size (𝐷50) on the root rootsoil interaction.
APA, Harvard, Vancouver, ISO, and other styles
5

Strauss, S. H., V. Busov, K. Kosola, J. Kennedy, J. Morrell, C. Ma, A. Elias, and E. Etherington. Genetic modification of gibberellic acid signaling to promote carbon sequestration in tree roots and stems. Office of Scientific and Technical Information (OSTI), May 2009. http://dx.doi.org/10.2172/952484.

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

Busov, Victor. GENETIC MODIFICATION OF GIBBERELLIC ACID SIGNALING TO PROMOTE CARBON SEQUESTRATION IN TREE ROOTS AND STEMS. Office of Scientific and Technical Information (OSTI), March 2013. http://dx.doi.org/10.2172/1067341.

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

Miller, Richard E., Timothy B. Harrington, Walter G. Thies, and Jeff Madsen. Laminated root rot in a western Washington plantation: 8-year mortality and growth of Douglas-fir as related to infected stumps, tree density, and fertilization. Portland, OR: U.S. Department of Agriculture, Forest Service, Pacific Northwest Research Station, 2006. http://dx.doi.org/10.2737/pnw-rp-569.

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

Furman, Alex, Jan Hopmans, Shmuel Assouline, Jirka Simunek, and Jim Richards. Soil Environmental Effects on Root Growth and Uptake Dynamics for Irrigated Systems. United States Department of Agriculture, February 2011. http://dx.doi.org/10.32747/2011.7592118.bard.

Full text
Abstract:
Root water uptake is perhaps the most important unknown in the mass balance of hydrological and agricultural systems. The understanding and the ability to predict root uptake and the way it is influence by environmental conditions has great potential in increasing water and fertilizer use efficiency and allowing better control of water and contaminant leach towards groundwater. This BARD supported research is composed of several components, including a) intensive laboratory work for the quantification of root uptake and the way it is controlled by environmental conditions; b) development of tools for laboratory and field use that can help in sensing very low water fluxes and water content, which is a necessity for studying root uptake; c) development of capabilities to model compensated root uptake; and d) development of a database that will allow calibration of such a model. In addition some auxiliary research was performed as reported later. Some of the components, and especially the modeling and the HPP development, were completed in the framework of the project and even published in the international literature. The completed components provide a modeling environment that allows testing root compensated uptake modeling, a tool that is extremely important for true mechanistic understanding of root uptake and irrigation design that is based on mechanistic and not partially based myth. The new button HPP provides extended level of utilization of this important tool. As discussed below, other components did not get to maturity stage during the period of the project, but comprehensive datasets were collected and will be analyzed in the near future. A comprehensive dataset of high temporal and spatial resolution water contents for two different setups was recorded and should allow us understanding f the uptake at these fine resolutions. Additional important information about root growth dynamics and its dependence in environmental conditions was achieved in both Israel and the US. Overall, this BARD supported project provided insight on many important phenomena related to root uptake and to high resolution monitoring in the vadose zone. Although perhaps not to the level that we initially hoped for, we achieved better understanding of the related processes, better modeling capabilities, and better datasets that will allow continuation of this effort in the near future.
APA, Harvard, Vancouver, ISO, and other styles
9

Dasberg, Shmuel, Jan W. Hopmans, Larry J. Schwankl, and Dani Or. Drip Irrigation Management by TDR Monitoring of Soil Water and Solute Distribution. United States Department of Agriculture, August 1993. http://dx.doi.org/10.32747/1993.7568095.bard.

Full text
Abstract:
Drip irrigation has the potential of high water use efficiency, but actual water measurement is difficult because of the limited wetted volume. Two long-term experiments in orchards in Israel and in California and several field crop studies supported by this project have demonstrated the feasibility of precise monitoring of soil water distribution for drip irrigation in spite of the limited soil wetting. Time Domain Reflectometry (TDR) enables in situ measurement of soil water content of well defined small volumes. Several approaches were tried in monitoring the soil water balance in the field during drip irrigation. These also facilitated the estimation of water uptake: 1. The use of multilevel moisture probe TDR system. This approach proved to be of limited value because of the extremely small diameter of measurement. 2. The placement of 20 cm long TDR probes at predetermined distances from the drippers in citrus orchards. 3. Heavy instrumentation with neutron scattering access tubes and tensiometers of a single drip irrigated almond tree. 4. High resolution spatial and temporal measurements (0.1m x 0.1m grid) of water content by TDR in corn irrigated by surface and subsurface drip. The latter approach was accompanied by parametric modelling of water uptake intensity patterns by corn roots and superimposed with analytical solutions for water flow from point and line sources. All this lead to general and physically based suggestions for the placement of soil water sensors for scheduling drip irrigation.
APA, Harvard, Vancouver, ISO, and other styles
10

Venäläinen, Ari, Sanna Luhtala, Mikko Laapas, Otto Hyvärinen, Hilppa Gregow, Mikko Strahlendorff, Mikko Peltoniemi, et al. Sää- ja ilmastotiedot sekä uudet palvelut auttavat metsäbiotaloutta sopeutumaan ilmastonmuutokseen. Finnish Meteorological Institute, January 2021. http://dx.doi.org/10.35614/isbn.9789523361317.

Full text
Abstract:
Climate change will increase weather induced risks to forests, and thus effective adaptation measures are needed. In Säätyö project funded by the Ministry of Agriculture and Forestry, we have summarized the data that facilitate adaptation measures, developed weather and climate services that benefit forestry, and mapped what kind of new weather and climate services are needed in forestry. In addition, we have recorded key further development needs to promote adaptation. The Säätyö project developed a service product describing the harvesting conditions of trees based on the soil moisture assessment. The output includes an analysis of the current situation and a 10-day forecast. In the project we also tested the usefulness of long forecasts beyond three months. The weather forecasting service is sidelined and supplemented by another co-operation project between the Finnish Meteorological Institute and Metsäteho called HarvesterSeasons (https://harvesterseasons.com/). The HarvesterSeasons service utilizes long-term forecasts of up to 6 months to assess terrain bearing conditions. A test version of a wind damage risk tool was developed in cooperation with the Department of Forest Sciences of the University of Eastern Finland and the Finnish Meteorological Institute. It can be used to calculate the wind speeds required in a forest area for wind damage (falling trees). It is currently only suitable for researcher use. In the Säätyö project the possibility of locating the most severe wind damage areas immediately after a storm was also tested. The method is based on the spatial interpolation of wind observations. The method was used to analyze storms that caused forest damages in the summer and fall of 2020. The produced maps were considered illustrative and useful to those responsible for compiling the situational picture. The accumulation of snow on tree branches, can be modeled using weather data such as rainfall, temperature, air humidity, and wind speed. In the Säätyö project, the snow damage risk assessment model was further developed in such a way that, in addition to the accumulated snow load amount, the characteristics of the stand and the variations in terrain height were also taken into account. According to the verification performed, the importance of abiotic factors increased under extreme snow load conditions (winter 2017-2018). In ordinary winters, the importance of biotic factors was emphasized. According to the comparison, the actual snow damage could be explained well with the tested model. In the interviews and workshop, the uses of information products, their benefits, the conditions for their introduction and development opportunities were mapped. According to the results, diverse uses and benefits of information products and services were seen. Information products would make it possible to develop proactive forest management, which would reduce the economic costs caused by wind and snow damages. A more up-to-date understanding of harvesting conditions, enabled by information products, would enhance the implementation of harvesting and harvesting operations and the management of timber stocks, as well as reduce terrain, trunk and root damage. According to the study, the introduction of information is particularly affected by the availability of timeliness. Although the interviewees were not currently willing to pay for the information products developed in the project, the interviews highlighted several suggestions for the development of information products, which could make it possible to commercialize them.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Rooted tree' 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