Relevant bibliographies by topics / Tree distance

Academic literature on the topic 'Tree distance'

Author: Grafiati
Published: 9 March 2023
Last updated: 10 March 2023

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

Select a source type:

Contents

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

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 "Tree distance"

1

LYAUDET, LAURENT, PAULIN MELATAGIA YONTA, MAURICE TCHUENTE, and RENÉ NDOUNDAM. "DISTANCE PRESERVING SUBTREES IN MINIMUM AVERAGE DISTANCE SPANNING TREES." Discrete Mathematics, Algorithms and Applications 05, no. 03 (September 2013): 1350010. http://dx.doi.org/10.1142/s1793830913500109.

Full text
Abstract:
Given an undirected graph G = (V, E) with n vertices and a positive length w(e) on each edge e ∈ E, we consider Minimum Average Distance (MAD) spanning trees i.e., trees that minimize the path length summed over all pairs of vertices. One of the first results on this problem is due to Wong who showed in 1980 that a Distance Preserving (DP) spanning tree rooted at the median of G is a 2-approximate solution. On the other hand, Dankelmann has exhibited in 2000 a class of graphs where no MAD spanning tree is distance preserving from a vertex. We establish here a new relation between MAD and DP trees in the particular case where the lengths are integers. We show that in a MAD spanning tree of G, each subtree H′ = (V′, E′) consisting of a vertex [Formula: see text] and the union of branches of [Formula: see text] that are each of size less than or equal to [Formula: see text], where w+ is the maximum edge-length in G, is a distance preserving spanning tree of the subgraph of G induced by V′.
APA, Harvard, Vancouver, ISO, and other styles
2

Adams, Richard H., and Todd A. Castoe. "Probabilistic Species Tree Distances: Implementing the Multispecies Coalescent to Compare Species Trees Within the Same Model-Based Framework Used to Estimate Them." Systematic Biology 69, no. 1 (May 14, 2019): 194–207. http://dx.doi.org/10.1093/sysbio/syz031.

Full text
Abstract:
Abstract Despite the ubiquitous use of statistical models for phylogenomic and population genomic inferences, this model-based rigor is rarely applied to post hoc comparison of trees. In a recent study, Garba et al. derived new methods for measuring the distance between two gene trees computed as the difference in their site pattern probability distributions. Unlike traditional metrics that compare trees solely in terms of geometry, these measures consider gene trees and associated parameters as probabilistic models that can be compared using standard information theoretic approaches. Consequently, probabilistic measures of phylogenetic tree distance can be far more informative than simply comparisons of topology and/or branch lengths alone. However, in their current form, these distance measures are not suitable for the comparison of species tree models in the presence of gene tree heterogeneity. Here, we demonstrate an approach for how the theory of Garba et al. (2018), which is based on gene tree distances, can be extended naturally to the comparison of species tree models. Multispecies coalescent (MSC) models parameterize the discrete probability distribution of gene trees conditioned upon a species tree with a particular topology and set of divergence times (in coalescent units), and thus provide a framework for measuring distances between species tree models in terms of their corresponding gene tree topology probabilities. We describe the computation of probabilistic species tree distances in the context of standard MSC models, which assume complete genetic isolation postspeciation, as well as recent theoretical extensions to the MSC in the form of network-based MSC models that relax this assumption and permit hybridization among taxa. We demonstrate these metrics using simulations and empirical species tree estimates and discuss both the benefits and limitations of these approaches. We make our species tree distance approach available as an R package called pSTDistanceR, for open use by the community.
APA, Harvard, Vancouver, ISO, and other styles
3

Xia, Xuhua. "Imputing missing distances in molecular phylogenetics." PeerJ 6 (July 24, 2018): e5321. http://dx.doi.org/10.7717/peerj.5321.

Full text
Abstract:
Missing data are frequently encountered in molecular phylogenetics, but there has been no accurate distance imputation method available for distance-based phylogenetic reconstruction. The general framework for distance imputation is to explore tree space and distance values to find an optimal combination of output tree and imputed distances. Here I develop a least-square method coupled with multivariate optimization to impute multiple missing distance in a distance matrix or from a set of aligned sequences with missing genes so that some sequences share no homologous sites (whose distances therefore need to be imputed). I show that phylogenetic trees can be inferred from distance matrices with about 10% of distances missing, and the accuracy of the resulting phylogenetic tree is almost as good as the tree from full information. The new method has the advantage over a recently published one in that it does not assume a molecular clock and is more accurate (comparable to maximum likelihood method based on simulated sequences). I have implemented the function in DAMBE software, which is freely available athttp://dambe.bio.uottawa.ca.
APA, Harvard, Vancouver, ISO, and other styles
4

Juan, Justie Su-Tzu, Yi-Ching Chen, Chen-Hui Lin, and Shu-Chuan Chen. "Efficient Approaches to the Mixture Distance Problem." Algorithms 13, no. 12 (November 28, 2020): 314. http://dx.doi.org/10.3390/a13120314.

Full text
Abstract:
The ancestral mixture model, an important model building a hierarchical tree from high dimensional binary sequences, was proposed by Chen and Lindsay in 2006. As a phylogenetic tree (or evolutionary tree), a mixture tree created from ancestral mixture models, involves the inferred evolutionary relationships among various biological species. Moreover, it contains the information of time when the species mutates. The tree comparison metric, an essential issue in bioinformatics, is used to measure the similarity between trees. To our knowledge, however, the approach to the comparison between two mixture trees is still unknown. In this paper, we propose a new metric named the mixture distance metric, to measure the similarity of two mixture trees. It uniquely considers the factor of evolutionary times between trees. If we convert the mixture tree that contains the information of mutation time of each internal node into a weighted tree, the mixture distance metric is very close to the weighted path difference distance metric. Since the converted mixture tree forms a special weighted tree, we were able to design a more efficient algorithm to calculate this new metric. Therefore, we developed two algorithms to compute the mixture distance between two mixture trees. One requires O(n2) and the other requires O(nh1h2) computational time with O(n) preprocessing time, where n denotes the number of leaves in the two mixture trees, and h1 and h2 denote the heights of these two trees.
APA, Harvard, Vancouver, ISO, and other styles
5

Mlinaric, Danijel, Boris Milasinovic, and Vedran Mornar. "Tree Inheritance Distance." IEEE Access 8 (2020): 52489–504. http://dx.doi.org/10.1109/access.2020.2981260.

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

Ledermann, Thomas. "Evaluating the performance of semi-distance-independent competition indices in predicting the basal area growth of individual trees." Canadian Journal of Forest Research 40, no. 4 (April 2010): 796–805. http://dx.doi.org/10.1139/x10-026.

Full text
Abstract:
Recent individual-tree growth models use either distance-dependent or distance-independent competition measures to predict tree increment. However, both measures have deficiencies: the latter because the effects of local variation in spacing are not represented, and the former because they cannot be calculated from normal inventory data for lack of spatial information. To overcome these shortcomings, the new class of semi-distance-independent competition indices was proposed. A semi-distance-independent competition index is a distance-independent competition measure that uses only the trees of a single small sample plot that includes the subject tree. Moreover, a semi-distance-independent competition index can be calculated in an analogous way to a distance-dependent competition index by using sample plot size, tree attributes, and intertree distances. However, many semi-distance-independent competition measures are based on simple tree attributes. Therefore, the objective of this study was to analyze if the semi-distance-independent competition indices explain the variation in measurements of tree increment more or less effectively than a set of classical distance-dependent competition indices. The results show that some of the semi-distance-independent competition indices explain at least as much variation in measurements of tree increment as any of the distance-dependent competition indices.
APA, Harvard, Vancouver, ISO, and other styles
7

Dill, Lawrence M., and Robert Houtman. "The influence of distance to refuge on flight initiation distance in the gray squirrel (Sciurus carolinensis)." Canadian Journal of Zoology 67, no. 1 (January 1, 1989): 233–35. http://dx.doi.org/10.1139/z89-033.

Full text
Abstract:
Gray squirrels (Sciurus carolinensis) typically run to the nearest tree to escape from predators they encounter while foraging on the ground. As the risk of capture increases with distance from the refuge tree, squirrels feeding far from trees should have greater flight initiation distances than those feeding closer by. This prediction was confirmed: flight initiation distance in response to a motorized model predator (a cat) increased as distance to refuge increased. This could not be attributed to any effect of distance to refuge on vigilance.
APA, Harvard, Vancouver, ISO, and other styles
8

Khan, Md Nasir Uddin, and Mohammad Kamrul Hasan. "Performance of bitter gourd in association with Karanja (Pongamia pinnata L.) tree." Research in Agriculture Livestock and Fisheries 2, no. 1 (April 27, 2015): 63–73. http://dx.doi.org/10.3329/ralf.v2i1.23030.

Full text
Abstract:
The study was conducted at the Char Kalibari which is situated along the bank of Old Brahmaputra River under Sadar Upazila of Mymensingh district during November 2013 to March 2014 to observe the performance of bitter gourd (Momordica charantia) as arable crop with karanja (Pongamia pinnata L.) trees in an agroforestry system. The experiment was laid out in a Randomized Complete Block Design (RCBD) with three replications having four treatments viz., T0 (open field condition referred as control), T1 (< 50 cm distance from the tree base), T2 (50-100 cm distance from the tree base) and T3 (>100 cm distance from the tree base). The result showed that all the growth parameters and yield of bitter gourd were significantly influenced by the associated tree component at different distances from the karanja tree base. The highest (1.92 tha-1) fresh yield of bitter gourd was obtained in open field condition compare to any other treatments but no significant different was found from the treatment T3 (distance >100 cm from the tree) while the lowest (0.8 tha-1) in < 50 cm distance from the tree base. It was found that on an average 58.33%, 29.17% and 14.58% yield of bitter gourd were decreased in <50 cm, 50-100 cm and >100 cm distances from karanja tree base compare to open field condition. On the other hand, the growth performance of karanja trees i.e. both height and girth increment was better in sole tree condition compare to tree with bitter gourd condition. Therefore, it can be concluded that tree-crop combination i.e. >100 cm distance from the tree base would be possible although there was some yield loss (14.58%) which was less significant compare to alone bitter gourd. Through this combination we can get diversified product. So, we can follow this agroforestry system to improve char based farming system of Bangladesh during the early establishment period of trees.Res. Agric., Livest. Fish.2(1): 63-73, April 2015
APA, Harvard, Vancouver, ISO, and other styles
9

Kim, Jaehee, Noah A. Rosenberg, and Julia A. Palacios. "Distance metrics for ranked evolutionary trees." Proceedings of the National Academy of Sciences 117, no. 46 (November 2, 2020): 28876–86. http://dx.doi.org/10.1073/pnas.1922851117.

Full text
Abstract:
Genealogical tree modeling is essential for estimating evolutionary parameters in population genetics and phylogenetics. Recent mathematical results concerning ranked genealogies without leaf labels unlock opportunities in the analysis of evolutionary trees. In particular, comparisons between ranked genealogies facilitate the study of evolutionary processes of different organisms sampled at multiple time periods. We propose metrics on ranked tree shapes and ranked genealogies for lineages isochronously and heterochronously sampled. Our proposed tree metrics make it possible to conduct statistical analyses of ranked tree shapes and timed ranked tree shapes or ranked genealogies. Such analyses allow us to assess differences in tree distributions, quantify estimation uncertainty, and summarize tree distributions. We show the utility of our metrics via simulations and an application in infectious diseases.
APA, Harvard, Vancouver, ISO, and other styles
10

Jiang, Yueyu, Puoya Tabaghi, and Siavash Mirarab. "Learning Hyperbolic Embedding for Phylogenetic Tree Placement and Updates." Biology 11, no. 9 (August 24, 2022): 1256. http://dx.doi.org/10.3390/biology11091256.

Full text
Abstract:
Phylogenetic placement, used widely in ecological analyses, seeks to add a new species to an existing tree. A deep learning approach was previously proposed to estimate the distance between query and backbone species by building a map from gene sequences to a high-dimensional space that preserves species tree distances. They then use a distance-based placement method to place the queries on that species tree. In this paper, we examine the appropriate geometry for faithfully representing tree distances while embedding gene sequences. Theory predicts that hyperbolic spaces should provide a drastic reduction in distance distortion compared to the conventional Euclidean space. Nevertheless, hyperbolic embedding imposes its own unique challenges related to arithmetic operations, exponentially-growing functions, and limited bit precision, and we address these challenges. Our results confirm that hyperbolic embeddings have substantially lower distance errors than Euclidean space. However, these better-estimated distances do not always lead to better phylogenetic placement. We then show that the deep learning framework can be used not just to place on a backbone tree but to update it to obtain a fully resolved tree. With our hyperbolic embedding framework, species trees can be updated remarkably accurately with only a handful of genes.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Tree distance"

1

Rhodes, Benjamin Robert. "On the Discrete Number of Tree Graphs." Thesis, Virginia Tech, 2020. http://hdl.handle.net/10919/98536.

Full text
Abstract:
We study a generalization of the problem of finding bounds on the number of discrete chains, which itself is a generalization of the Erdős unit distance problem. Given a set of points in Euclidean space and a tree graph consisting of a much smaller number of vertices, we study the maximum possible number of tree graphs which can be represented by a prescribed tree graph. We derive an algorithm for finding tight bounds for this family of problems up to chain bound discrepancy, and give upper and lower bounds in special cases.
Master of Science
We study a generalization of the problem of finding bounds on the number of discrete chains, which itself is a generalization of the Erdős unit distance problem, a famous mathematics problem named after mathematician Paul Erdős. Given a set of points, and a tree graph of a much smaller amount of vertices, we study the maximum possible number of tree graphs which can be represented by a prescribed tree graph. We derive an algorithm for finding tight bounds for this family of problems up to chain bound discrepancy, and give upper and lower bounds in special cases.
APA, Harvard, Vancouver, ISO, and other styles
2

Mou, Chengcheng. "A Comparative Study of Dual-tree Algorithms for Computing Spatial Distance Histogram." Scholar Commons, 2015. http://scholarcommons.usf.edu/etd/5836.

Full text
Abstract:
Particle simulation has become an important research technique in many scientific and engineering fields in latest years. However, these simulations will generate countless data, and database they required would therefore deal with very challenging tasks in terms of data management, storage, and query processing. The two-body correlation function (2-BCFs), a statistical learning measurement to evaluate the datasets, has been mainly utilized to measure the spatial distance histogram (SDH). By using a straightforward method, the process of SDH query takes quadratic time. Recently, a novel algorithm has been proposed to compute the SDH based on the concept of density map (DM), and it reduces the running time to ϴ(N(3/2)) for two-dimensional data and ϴ (N(5/3) ) for three-dimensional data, respectively. In the DM-SDH algorithm, there are two types of DMs that can be plugged in for computation: Quad-tree (Oct-tree for three-dimensional data) and k-d tree data structure. In this thesis paper, by using the geometric method, we prove the unre- solvable ratios on the k-d tree. Further, we analyze and compare the difference in the performance in each potential case generated by these DM-SDH algorithms. Experimental results confirm our analysis and show that the k-d tree structure has better performance in terms of time complexity in all cases. However, our qualitative analysis shows that the Quad-tree (Oct-tree) has an advantage over the k-d tree on aspect of space complexity.
APA, Harvard, Vancouver, ISO, and other styles
3

García-González, Ignacio. "Comparison Of Different Distance Measures For Cluster Analysis Of Tree-Ring Series." Tree-Ring Society, 2008. http://hdl.handle.net/10150/622565.

Full text
Abstract:
Sixty individual ring-width series of oak (Quercus robur L.) from six sites in the northwestern Iberian Peninsula, ranging from 50 to 120 years, were grouped using hierarchical cluster analysis with different types of distance measures. Euclidean distances as well as other linkage distances based on statistics used to crossdate tree-ring series (Gleichläufigkeit and coefficient of correlation with its corresponding t-value) were compared. In addition, a new distance measure based on a corrected inversion of the Student’s t is proposed in the present paper, which takes into consideration the number of years used for series comparison. The Euclidean distances, commonly used in ecological analyses, inefficiently identified homogeneous units of trees based on their ring-width patterns. Among crossdating statistics, the correlation coefficient was more effective than Gleichläufigkeit, but the most satisfactory results were obtained when 1/t was used as distance measure. Finally, these methods of cluster analysis have been implemented into a computer program for future use of the dendrochronological community.
APA, Harvard, Vancouver, ISO, and other styles
4

Sharma, Luetel Sadhana. "Performance analysis of a binary-tree-based algorithm for computing Spatial Distance Histograms." [Tampa, Fla] : University of South Florida, 2009. http://purl.fcla.edu/usf/dc/et/SFE0003136.

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

Billingham, Martin Robert. "Genetic structure, localised adaptation and optimal outcrossing distance in two neotropical tree species." Thesis, University of Oxford, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.301795.

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

Comtet, Jean. "Passive phloem loading and long-distance transport in a synthetic tree-on-a-chip." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/101330.

Full text
Abstract:
Thesis: S.M., Massachusetts Institute of Technology, Department of Mechanical Engineering, 2015.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 45-46).
According to the Munch mechanism, vascular plants rely on osmotic pressure gradients to export sugars from regions of synthesis (mature leaves) to sugar sinks (roots, fruits). A crucial step in this process is the loading of sugars from photosynthetic cells to the export conduit (the phloem). In this thesis, we developed a synthetic microfluidic osmotic pump mimicking the mechanism of passive phloem loading, where sugars are transported by diffusion from a sugar reservoir to the phloem. This design allows the development of steady flow over several hours. We show that in our system, phloem concentration is set by a relative balance between loading by diffusion from the source and export by convection through the phloem, via a single nondimensional system-scale Peclet number that we call the flushing number. For large flushing numbers, export is limited by diffusion from the source, and flow rates scale weakly with transport resistance. For low flushing numbers, export is limited by convection through the phloem and phloem concentration is close to that of the source, leading to efficient export of water and sugars. In plants, passive phloem loading is used predominantly by trees. We show that the hydrostatic pressures developed in our synthetic system can reach up to ten bars and are thus compatible with the pressures expected to drive long-distance transport in large trees. Moreover, we show that the regime of efficient export in passive loaders is more accessible to plants with large transport resistances, providing a rational for the use of the passive loading mechanism by most tree species.
by Jean Comtet.
S.M.
APA, Harvard, Vancouver, ISO, and other styles
7

Mori, Tomoya. "Methods for Analyzing Tree-Structured Data and their Applications to Computational Biology." 京都大学 (Kyoto University), 2015. http://hdl.handle.net/2433/202741.

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

Elias, Isaac. "Computational problems in evolution : Multiple alignment, genome rearrangements, and tree reconstruction." Doctoral thesis, KTH, Numerical Analysis and Computer Science, NADA, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4170.

Full text
Abstract:

Reconstructing the evolutionary history of a set of species is a fundamental problem in biology. This thesis concerns computational problems that arise in different settings and stages of phylogenetic tree reconstruction, but also in other contexts. The contributions include:

• A new distance-based tree reconstruction method with optimal reconstruction radius and optimal runtime complexity. Included in the result is a greatly simplified proof that the NJ algorithm also has optimal reconstruction radius. (co-author Jens Lagergren)

• NP-hardness results for the most common variations of Multiple Alignment. In particular, it is shown that SP-score, Star Alignment, and Tree Alignment, are NP hard for all metric symbol distances over all binary or larger alphabets.

• A 1.375-approximation algorithm for Sorting By Transpositions (SBT). SBT is the problem of sorting a permutation using as few block-transpositions as possible. The complexity of this problem is still open and it was a ten-year-old open problem to improve the best known 1.5-approximation ratio. The 1.375-approximation algorithm is based on a new upper bound on the diameter of 3-permutations. Moreover, a new lower bound on the transposition diameter of the symmetric group is presented and the exact transposition diameter of simple permutations is determined. (co-author Tzvika Hartman)

• Approximation, fixed-parameter tractable, and fast heuristic algorithms for two variants of the Ancestral Maximum Likelihood (AML) problem: when the phylogenetic tree is known and when it is unknown. AML is the problem of reconstructing the most likely genetic sequences of extinct ancestors along with the most likely mutation probabilities on the edges, given the phylogenetic tree and sequences at the leafs. (co-author Tamir Tuller)

• An algorithm for computing the number of mutational events between aligned DNA sequences which is several hundred times faster than the famous Phylip packages. Since pairwise distance estimation is a bottleneck in distance-based phylogeny reconstruction, the new algorithm improves the overall running time of many distancebased methods by a factor of several hundred. (co-author Jens Lagergren)

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

Emprin, Gustave. "Une topologie pour les arbres labellés, application aux arbres aléatoires s-compacts." Thesis, Paris Est, 2019. http://www.theses.fr/2019PESC1032.

Full text
Abstract:
Dans cette thèse, nous développons un nouvel espace pour l'étude des espaces métriques labellés et mesurés, dans l'optique de décrire des arbres généalogiques dont la racine est infiniment ancienne. Dans ces arbres, le temps est représenté par une fonction label qui est 1-Lipschitz. On appelle espace métrique labellé S-compact et mesuré tout espace métrique E équipé d'une mesure nu et d'une fonction-label 1-Lipschitz de E dans R, avec la condition supplémentaire que chaque tranche (l'ensemble des points de E dont le label appartient à un compact de R) doit être compact et avoir mesure finie. On note XS l'ensemble des espaces métriques labellés mesurés S-compacts, considérés à isométries près. Sur XS, on définit une distance dLGHP de type Gromov qui compare les tranches. Il s'ensuit une étude de l'espace (XS, dLGHP), dont on montre qu'il est polonais. De cette étude, on déduit les propriétés de l'ensemble T des éléments de XS qui sont des arbres continus dont les labels décroissent à vitesse 1 quand on se déplace vers la ``racine'' (qui peut être infiniment loin). Chaque valeur possible de la fonction label représente une génération de l'arbre généalogique. On montre que (T, dLGHP) est aussi polonais. On définit ensuite quelques opérations mesurables sur T, dont le recollement aléatoire d'une forêt sur un arbre.On utilise enfin cette dernière opération pour construire un arbre aléatoire qui est un bon candidat pour généraliser l'arbre brownien conditionné par son temps local (construction due à Aldous)
In this thesis, we develop a new space for the study of measured labelled metric spaces, ultimately designed to represent genealogical trees with a root at generation minus infinity. The time in the genealogical tree is represented by a 1-Lipschitz label function. We define the notion of S-compact measured labelled metric space, that is a metric space E equipped with a measure nu and a 1-Lipschitz label function from E to R, with the additional condition that each slice (the set of points with labels in a compact of R) must be compact and have finite measure. On the space XS of measured labelled metric spaces (up to isometry), we define a distance dLGHP by comparing the slices and study the resulting metric space, which we find to be Polish.We proceed with the study of the set T of all elements of XS that are real tree in which the label function decreases at rate 1 when we go toward the root" (which can be infinitely far). Each possible value of the label function corresponds to a generation in the genealogical tree. We prove that (T, dLGHP) is Polish as well. We define a number of measurable operation on T, including a way to randomly graft a forest on a tree. We use this operation to build a particular random tree generalizing Aldous' Brownian motion conditioned on its local time
APA, Harvard, Vancouver, ISO, and other styles
10

Tsunamoto, Yoshihiro. "Seed dispersal dynamics of a fleshy-fruited tree Swida controversa by various frugivorous animals." Kyoto University, 2018. http://hdl.handle.net/2433/235096.

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

Books on the topic "Tree distance"

1

Hirai, Hiroshi. Characterization of the distance between subtrees of a tree by the associated tight span. Kyoto, Japan: Kyōto Daigaku Sūri Kaiseki Kenkyūjo, 2004.

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

Zhang, Kaizhong. On the editing distance between trees and related problems. New York: Courant Institute of Mathematical Sciences, New York University, 1987.

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

Crawford, H. Energy absorbers for tree surgeons: An investigation of fall distances for tree climbers equipped with sit harness or with full harness. Sudbury: HSE Books, 1996.

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

How to hike the AT: The nitty-gritty details of a long-distance trek. Mechanicsburg, PA: Stackpole Books, 2009.

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

1975-, Gutiérrez Arsenio, and Hernández Jorge Luis 1966-, eds. Cuerpos distantes: Tres fotógrafos en Querétaro : Demián Chávez, Arsenio Gutiérrez, Jorge Luis Hernández. Santiago de Querétaro, Qro. [Mexico]: Fondo Editorial de Querétaro, 2004.

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

1968-, Wulder Michael A., and Pacific Forestry Centre, eds. Calculating the risk of mountain pine beetle attack: A comparison of distance- and density-based estimates of beetle pressure. Victoria, B.C: Pacific Forestry Centre, 2007.

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

Fitzsimons, Peter, 1943- Foreword by, ed. The world at my feet: The extraordinary story of the record-breaking fastest run around the Earth. Saint Leonards: Allen & Unwin., 2015.

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

Barbari, Matteo, and Francesco Sorbetti Guerri, eds. L’edilizia rurale tra sviluppo tecnologico e tutela del territorio. Florence: Firenze University Press, 2013. http://dx.doi.org/10.36253/978-88-6655-394-6.

Full text
Abstract:
La II Sezione dell’AIIA ha promosso un’occasione di incontro, confronto e riflessione sul tema “L’edilizia rurale tra sviluppo tecnologico e tutela del territorio” attraverso l’esposizione dei risultati delle più recenti ricerche condotte sull’argomento dai ricercatori del SSD “Costruzioni rurali e territorio agroforestale”. I lavori hanno previsto tre sessioni: nell’ambito della prima sono stati presentati i risultati del PRIN 2008 su “Integrazione di sistemi tecnologici innovativi per il monitoraggio a distanza di animali”, con interventi delle varie Unità Operative coinvolte. Nella seconda e terza sessione sono stati presentati i risultati scientifici di ricerche sui temi dell’Innovazione tecnologica negli edifici agricoli e delle Tendenze nella progettazione di edifici agricoli per un uso sostenibile del territorio.
APA, Harvard, Vancouver, ISO, and other styles
9

Peretti, Paola. Distance Between Me and the Cherry Tree. Hot Key Books, 2018.

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

Peretti, Paola, and Denise Muir. Distance Between Me and the Cherry Tree. Simon & Schuster Children's Publishing, 2019.

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

Book chapters on the topic "Tree distance"

1

Aratsu, Taku, Kouichi Hirata, and Tetsuji Kuboyama. "Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes." In Lecture Notes in Computer Science, 93–104. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-540-95891-8_12.

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

Bernard, Marc, Amaury Habrard, and Marc Sebban. "Learning Stochastic Tree Edit Distance." In Lecture Notes in Computer Science, 42–53. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11871842_9.

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

Bapat, Ravindra B. "Distance Matrix of a Tree." In Universitext, 115–30. London: Springer London, 2014. http://dx.doi.org/10.1007/978-1-4471-6569-9_9.

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

Akutsu, Tatsuya, Daiji Fukagawa, and Atsuhiro Takasu. "Approximating Tree Edit Distance Through String Edit Distance." In Algorithms and Computation, 90–99. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11940128_11.

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

Ko, Sang-Ki, Yo-Sub Han, and Kai Salomaa. "Top-Down Tree Edit-Distance of Regular Tree Languages." In Language and Automata Theory and Applications, 466–77. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-04921-2_38.

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

Torsello, Andrea, and Edwin R. Hancock. "Tree Edit Distance from Information Theory." In Graph Based Representations in Pattern Recognition, 71–82. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-45028-9_7.

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

Kouylekov, Milen, and Bernardo Magnini. "Tree edit distance for textual entailment." In Recent Advances in Natural Language Processing IV, 167–76. Amsterdam: John Benjamins Publishing Company, 2007. http://dx.doi.org/10.1075/cilt.292.22kou.

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

Chegrane, Ibrahim, Imane Hocine, Saïd Yahiaoui, Ahcene Bendjoudi, and Nadia Nouali-Taboudjemat. "Graph Edit Distance Compacted Search Tree." In Similarity Search and Applications, 181–89. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-17849-8_14.

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

Dulucq, Serge, and Hélène Touzet. "Analysis of Tree Edit Distance Algorithms." In Combinatorial Pattern Matching, 83–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-44888-8_7.

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

Han, Yo-Sub, and Sang-Ki Ko. "Alignment Distance of Regular Tree Languages." In Implementation and Application of Automata, 126–37. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-60134-2_11.

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

Conference papers on the topic "Tree distance"

1

"Clustering by Tree Distance for Parse Tree Normalisation." In The 3rd International Workshop on Natural Language Understanding and Cognitive Science. SciTePress - Science and and Technology Publications, 2006. http://dx.doi.org/10.5220/0002502400910100.

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

Munthe Caspersen, Kent, Martin Bjeldbak Madsen, Andreas Berre Eriksen, and Bo Thiesson. "A Hierarchical Tree Distance Measure for Classification." In 6th International Conference on Pattern Recognition Applications and Methods. SCITEPRESS - Science and Technology Publications, 2017. http://dx.doi.org/10.5220/0006198505020509.

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

Akash, Pritom Saha, Md Eusha Kadir, Amin Ahsan Ali, and Mohammad Shoyaib. "Inter-node Hellinger Distance based Decision Tree." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/272.

Full text
Abstract:
This paper introduces a new splitting criterion called Inter-node Hellinger Distance (iHD) and a weighted version of it (iHDw) for constructing decision trees. iHD measures the distance between the parent and each of the child nodes in a split using Hellinger distance. We prove that this ensures the mutual exclusiveness between the child nodes. The weight term in iHDw is concerned with the purity of individual child node considering the class imbalance problem. The combination of the distance and weight term in iHDw thus favors a partition where child nodes are purer and mutually exclusive, and skew insensitive. We perform an experiment over twenty balanced and twenty imbalanced datasets. The results show that decision trees based on iHD win against six other state-of-the-art methods on at least 14 balanced and 10 imbalanced datasets. We also observe that adding the weight to iHD improves the performance of decision trees on imbalanced datasets. Moreover, according to the result of the Friedman test, this improvement is statistically significant compared to other methods.
APA, Harvard, Vancouver, ISO, and other styles
4

Sidorov, Grigori, Helena Gomez-Adorno, Ilia Markov, David Pinto, and Nahun Loya. "Computing text similarity using Tree Edit Distance." In 2015 Annual Conference of the North American Fuzzy Information Processing Society (NAFIPS) held jointly with 2015 5th World Conference on Soft Computing (WConSC). IEEE, 2015. http://dx.doi.org/10.1109/nafips-wconsc.2015.7284129.

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

Lakkaraju, Praveen, Susan Gauch, and Mirco Speretta. "Document similarity based on concept tree distance." In the nineteenth ACM conference. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1379092.1379118.

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

Becker, Tilman, Aravind K. Joshi, and Owen Rambow. "Long-distance scrambling and tree adjoining grammars." In the fifth conference. Morristown, NJ, USA: Association for Computational Linguistics, 1991. http://dx.doi.org/10.3115/977180.977185.

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

Kuehn, Eileen, and Achim Streit. "Online Distance Measurement for Tree Data Event Streams." In 2016 IEEE 14th Intl Conf on Dependable, Autonomic and Secure Computing, 14th Intl Conf on Pervasive Intelligence and Computing, 2nd Intl Conf on Big Data Intelligence and Computing and Cyber Science and Technology Congress(DASC/PiCom/DataCom/CyberSciTech)2016. IEEE, 2016. http://dx.doi.org/10.1109/dasc-picom-datacom-cyberscitec.2016.122.

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

Reis, D. C., P. B. Golgher, A. S. Silva, and A. F. Laender. "Automatic web news extraction using tree edit distance." In the 13th conference. New York, New York, USA: ACM Press, 2004. http://dx.doi.org/10.1145/988672.988740.

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

Liu, Quan, Daojing Hu, and Qicui Yan. "Decision tree algorithm based on average Euclidean distance." In 2010 2nd International Conference on Future Computer and Communication. IEEE, 2010. http://dx.doi.org/10.1109/icfcc.2010.5497736.

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

"Tree Distance in Answer Retrieval and Parser Evaluation." In The 2nd International Workshop on Natural Language Understanding and Cognitive Science. SciTePress - Science and and Technology Publications, 2005. http://dx.doi.org/10.5220/0002565101550160.

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

Reports on the topic "Tree distance"

1

Saltus, Christina, and Eric Britzke. Literature review : macrohabitat metrics to identify presence of chiroptera on the landscape in the United States. Engineer Research and Development Center (U.S.), September 2022. http://dx.doi.org/10.21079/11681/45523.

Full text
Abstract:
This special report reviews current scientific literature to identify the most commonly cited metrics used to describe the macrohabitat criteria important for Chiroptera presence in the United States. The review evaluates 69 scientific articles from 1994 to 2018. The most commonly cited metrics were divided into four main categories: tree-species-level metrics, landscape-level metrics, distance metrics, and topographic and atmospheric metrics. Of all metrics found, the top six most common metrics noted across all articles were percent canopy cover, diameter at breast height (DBH), forest type, distance to water, distance to roads or other urban features, and tree density. In addition, 27 of the 47 (57%) bat species located within the United States were represented. These metrics provide important insight into the regional or national species-level distribution and assist with modeling the relationship between species distribution and habitat change.
APA, Harvard, Vancouver, ISO, and other styles
2

Traina, Caetano, Traina Jr., Faloutsos Agma J., and Christos. Distance Exponent: A New Concept for Selectivity Estimation in Metric Trees. Fort Belvoir, VA: Defense Technical Information Center, March 1999. http://dx.doi.org/10.21236/ada363780.

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

Kvalbein, Astrid. Wood or blood? Norges Musikkhøgskole, August 2018. http://dx.doi.org/10.22501/nmh-ar.481278.

Full text
Abstract:
Wood or Blood? New scores and new sounds for voice and clarinet Astrid Kvalbein and Gjertrud Pedersen, Norwegian Academy of Music What is this thing called a score, and how do we relate to it as performers, in order to realize a musical work? This is the fundamental question of this exposition. As a duo we have related to scores in a variety of ways over the years: from the traditional reading and interpreting of sheet music of works by distant (some dead) composers, to learning new works in dialogue with living composers and to taking part in the creative processes from the commissioning of a work to its premiere and beyond. This reflective practice has triggered many questions: could the score for instance be conceptualized as a contract, in which some elements are negotiable and others are not? Where two equal parts, the performer(s) and the composer might have qualitatively different assignments on how to realize the music? Finally: might reflecting on such questions influence our interpretative practices? To shed light on these issues, we take as examples three works from our recent repertoire: Ragnhild Berstad’s Vevtråd (Weaving thread, 2010), Jan Martin Smørdal’s The Lesser Nighthawk (2012) and Lene Grenager’s Tre eller blod (Wood or blood, 2005). We will share – attempt to unfold – some of the experiences gained from working with this music, in close collaboration and dialogue with the composers. Observing the processes from a certain temporal distance, we see how our attitudes as a duo has developed over a longer span of time, into a more confident 'we'.
APA, Harvard, Vancouver, ISO, and other styles
4

Cortés-Castillo, Denisse Viviana, Blanca Catalina Albarracín, and María Angélica Cardozo. Mitos y realidades de la dimensión ambiental. Universidad Nacional Abierta y a Distancia, December 2020. http://dx.doi.org/10.22490/ecapma.4088.

Full text
Abstract:
El tema ambiental en Colombia ha ocupado un renglón relevante en el país desde hace varias décadas, situación que ha permeado a la comunidad académica. Esto ha resultado en la creación de programas cuya afinidad ha generado confusión sobre el alcance de sus profesionales y la distancia disciplinar entre los mismos. Con el propósito de abordar este y otros temas, desde la Cadena Ambiental de la Escuela de Ciencias Agrícolas, Pecuarias y del Medio Ambiente – ECAPMA, se desarrolló un conversatorio titulado “Mitos y realidades de la dimensión ambiental” que reunió a seis (6) expertos de las áreas de la Ingeniería Ambiental y Administración Ambiental. La discusión con los panelistas giró en torno a tres situaciones puntuales relacionadas con la dimensión ambiental y el quehacer propio de sus disciplinas. A partir de las opiniones expresadas, e información secundaría se presenta en este documento un análisis sobre los resultados obtenidos en el foro.
APA, Harvard, Vancouver, ISO, and other styles
5

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
6

García Salamanca, Angela Viviana, Julieth Nataly Lesmes, and Andrés Felipe Ruiz Castro. Prospectiva de la formación en salud universitaria. Universidad Nacional Abierta y a Distancia - UNAD, 2019. http://dx.doi.org/10.22490/ecisa.4762.

Full text
Abstract:
El estudio que se presenta a continuación tiene como objetivo realizar un estudio prospectivo para la Escuela de Ciencias de la Salud de la Universidad Nacional Abierta y a Distancia UNAD con un horizonte de tiempo al año 2026. Desarrollo. Su metodología se diseñó bajo un enfoque cualitativo de tipo descriptivo. El eje principal en el que se fundamentó el desarrollo de la investigación se enfocó en los postulados prospectivos de la escuela francesa representada por Michel Godet adaptado a los requerimientos del estudio en particular de la formación en salud. El procedimiento se dividió en tres etapas: Primera etapa, encuesta Delphi, busca determinar avances tecnológicos y tendencias de la educación en salud, Segunda etapa. Análisis estructural por medio del método MIC-MAC, Tercera etapa. Diseño de escenarios futuros y propuesta de escenario apuesta utilizando el método de ejes de Peter Schwartz. Conclusiones: Se evidenciaron cinco objetivos estratégicos para la formación en salud, como son: tecnosalud, infraestructura, investigación, redes académicas y transdisciplinariedad. Los ejes estratégicos permitieron diseñar cuatro posibles escenarios para la prospectiva en la formación en salud.
APA, Harvard, Vancouver, ISO, and other styles
7

Mayfield, Colin. Capacity Development in the Water Sector: the case of Massive Open On-line Courses. United Nations University Institute for Water, Environment and Health, January 2017. http://dx.doi.org/10.53328/mwud6984.

Full text
Abstract:
The Sustainable Development Goal 6 targets are all dependent on capacity development as outlined in SDG 6a “Expand international cooperation and capacity-building support to developing countries in water- and sanitation related activities and programmes “. Massive Open On-line Courses (MOOCs) and distance learning in general have a significant role to play in this expansion. This report examines the role that MOOCs and similar courses could play in capacity development in the water sector. The appearance of MOOCs in 2010/11 led within 4 years to a huge increase in this type of course and in student enrollment. Some problems with student dropout rates, over-estimating the transformational and disruptive nature of MOOCs and uncertain business models remain, but less “massive” MOOCs with more engaged students are overcoming these problems. There are many existing distance learning courses and programmes in the water sector designed to train and/ or educate professionals, operators, graduate and undergraduate students and, to a lesser extent, members of communities dealing with water issues. There are few existing true MOOCs in the water sector. MOOCs could supply significant numbers of qualified practitioners for the water sector. A suite of programmes on water-related topics would allow anyone to try the courses and determine whether they were appropriate and useful. If they were, the students could officially enroll in the course or programme to gain a meaningful qualification or simply to upgrade their qualifications. To make MOOCs more relevant to education and training in the water sector an analysis of the requirements in the sector and the potential demand for such courses is required. Cooperation between institutions preparing MOOCs would be desirable given the substantial time and funding required to produce excellent quality courses. One attractive model for cooperation would be to produce modules on all aspects of water and sanitation dealing with technical, scientific, social, legal and management topics. These should be produced by recognized experts in each field and should be “stand-alone” or complete in themselves. If all modules were made freely available, users or mentors could assemble different MOOCs by linking relevant modules. Then extracts, simplified or less technical versions of the modules could then be used to produce presentations to encourage public participation and for other training purposes. Adaptive learning, where course materials are more tailored to individual students based on their test results and reactions to the material, can be an integral part of MOOCs. MOOCs efficiently provide access to quality courses at low or no cost to students around the world, they enable students to try courses at their convenience, they can be tailored to both professional and technical aspects, and they are very suitable to provide adaptive learning courses. Cooperation between institutions would provide many course modules for the water sector that collectively could provide excellent programmes to address the challenges of capacity development for SDG 6 and other issues within the water sector.
APA, Harvard, Vancouver, ISO, and other styles
8

Hilbert, Martin, Salma Jalife Villalón, Carmen Enedina Rodríguez Armenta, Pedro Miguel Ruiz Martínez, Faraón Llorens, Cinthya Carolina Sánchez Osorio, and Ernesto Chinkes. Abierta configuration options Estrategia y transformación de las univerdades: un enfoque para el gobierno universitario. Inter-American Development Bank, April 2022. http://dx.doi.org/10.18235/0004200.

Full text
Abstract:
En América Latina, los estudiantes universitarios gastan unas ocho horas al día conectados a algún aparato, y tres horas diariamente conectados a redes sociales (GlobalWebIndex, 2020). Además, los datos son el nuevo petróleo. Las empresas más valiosas estudian datos sobre el comportamiento humano y lo convierten en valor económico. Su valor agregado consiste en extraer conocimiento de las observaciones y cambiar el comportamiento humano. Esto no solo suena muy similar a lo que hacen las universidades de investigación, definitivamente lo es. Por esto, en esta publicación explicamos lo lejos que ha llegado el paradigma digital y lo consolidado que está dentro de nuestras sociedades. Recorremos las características de la digitalización que afectan la enseñanza. La tecnología digital tiene varias características que dan forma a cualquiera de sus áreas de aplicación. Aquí Identificamos también cinco de ellas: economías de escala, fin de la distancia; tiempo atemporal; redes multidireccionales; y huella digital. Y describimos, por tanto, cómo cada una de estas características afecta a la impartición de la educación. Además, terminamos poniendo énfasis en su valor a futuro aún sin explotar por la mayoría de las universidades y analizamos algunos de los retos de la universidad en el ecosistema digital. Internamente, la revolución está transformando a la investigación, la huella digital cambia la manera de hacer ciencia empírica; la computación, el aprendizaje de máquina y la inteligencia artificial revoluciona la manera de hacer análisis; y las simulaciones computacionales permiten crear teoría a un ritmo sin precedentes. Es importante que las universidades sean conscientes de este entorno. Y de ahí la necesidad de cursos como el ofrecido por Universia, junto al Banco Interamericano de desarrollo, Curso Internacional para Rectores sobre Estrategia y Transformación Digital de la Universidad.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Tree distance' 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