Results 271 to 280 of about 919,373 (313)
Some of the next articles are maybe not open access.
2022
In Chapter 5, the authors take a broader view, locating in the song “Tree Tree Tree” Rogers’ long-standing interest in connections between people, places, animals, plants, and things. The song is used to show that children and parents are still connected, even when parents have to leave to go to work. The music is played by Yo-Yo Ma on the cello and by
Sara Lindey, Jason King
openaire +1 more source
In Chapter 5, the authors take a broader view, locating in the song “Tree Tree Tree” Rogers’ long-standing interest in connections between people, places, animals, plants, and things. The song is used to show that children and parents are still connected, even when parents have to leave to go to work. The music is played by Yo-Yo Ma on the cello and by
Sara Lindey, Jason King
openaire +1 more source
2023
This book is a warning and a toolkit for the future of forest recovery. The book investigates the critical biological threats endangering tree species native to the forests of eastern North America, providing a needed focus on this plight. The book suggests that if we are to save our forests, the first step is to recognize the threats in front of us ...
openaire +1 more source
This book is a warning and a toolkit for the future of forest recovery. The book investigates the critical biological threats endangering tree species native to the forests of eastern North America, providing a needed focus on this plight. The book suggests that if we are to save our forests, the first step is to recognize the threats in front of us ...
openaire +1 more source
SSRN Electronic Journal, 2002 The authors critically examine the Lucas tree model (LT-model) in asset pricing theory extended to include heterogeneous agents and multiple goods. Dividend streams of the trees are specified in terms of a particular good; different trees pay out indifferent goods.
David Cass, Anna Pavlova
openaire +3 more sources
The Tree-to-Tree Correction Problem
Journal of the ACM, 1979The tree-to-tree correctmn problem Is to determine, for two labeled ordered trees T and T', the distance from T to T' as measured by the mlmmum cost sequence of edit operaUons needed to transform T into T' The edit operations investigated allow changing one node of a tree into another node, deleting one node from a tree, or inserting a node into a tree
openaire +1 more source
Theory in Biosciences, 2010
Darwin saw similarities between the evolution of species and the evolution of languages, and it is now widely accepted that similarities between related languages can often be interpreted in terms of a bifurcating descent history (‘phylogenesis’). Such interpretations are supported when the distributions of shared and unshared traits (for example, in ...
James Steele, Anne Kandler
openaire +1 more source
Darwin saw similarities between the evolution of species and the evolution of languages, and it is now widely accepted that similarities between related languages can often be interpreted in terms of a bifurcating descent history (‘phylogenesis’). Such interpretations are supported when the distributions of shared and unshared traits (for example, in ...
James Steele, Anne Kandler
openaire +1 more source
Genome trees and the tree of life
Trends in Genetics, 2002Genome comparisons indicate that horizontal gene transfer and differential gene loss are major evolutionary phenomena that, at least in prokaryotes, involve a large fraction, if not the majority, of genes. The extent of these events casts doubt on the feasibility of constructing a 'Tree of Life', because the trees for different genes often tell ...
Yuri I, Wolf +3 more
openaire +2 more sources
2017
This chapter considers the problem of counting trees. Every connected graph G has a spanning tree, that is, a connected acyclic subgraph containing all the vertices of G. If G has no cycles, it is its own unique spanning tree. If G has cycles, we can locate any cycle and delete one of its edges. Repeat this process until no cycle remains.
openaire +1 more source
This chapter considers the problem of counting trees. Every connected graph G has a spanning tree, that is, a connected acyclic subgraph containing all the vertices of G. If G has no cycles, it is its own unique spanning tree. If G has cycles, we can locate any cycle and delete one of its edges. Repeat this process until no cycle remains.
openaire +1 more source
Journal of Symbolic Logic, 1971
This is an attempt to give a survey of recent results concerning trees. The article is an extended version of our talk in Oberwolfach (Schwarzwald) last May; the forests surrounding the Forschungsinstitut turned out to be a good inspiration.A tree is a partially ordered set T = (T, ≤) such that for every x ∈ T, the set = {y ∈ T: y < x} is well ...
openaire +2 more sources
This is an attempt to give a survey of recent results concerning trees. The article is an extended version of our talk in Oberwolfach (Schwarzwald) last May; the forests surrounding the Forschungsinstitut turned out to be a good inspiration.A tree is a partially ordered set T = (T, ≤) such that for every x ∈ T, the set = {y ∈ T: y < x} is well ...
openaire +2 more sources
Molecular Ecology, 1998
The practice of tracking geographical divergence along a phylogenetic tree has added an evolutionary perspective to biogeographic analysis within single species. In spite of the popularity of phylogeography, there is an emerging problem. Recurrent mutation and recombination both create homoplasy, multiple evolutionary occurrences of the same character ...
openaire +1 more source
The practice of tracking geographical divergence along a phylogenetic tree has added an evolutionary perspective to biogeographic analysis within single species. In spite of the popularity of phylogeography, there is an emerging problem. Recurrent mutation and recombination both create homoplasy, multiple evolutionary occurrences of the same character ...
openaire +1 more source
Interpreting Tree-to-Tree Queries
2006We establish correspondences between top-down tree building query languages and predicate logics. We consider the expressive power of the query language XQ, a clean core of the practitioner's language XQuery. We show that all queries in XQ with only atomic equality are equivalent to “first-order interpretations”, an analog to first-order logic (FO) in ...
Michael Benedikt, Christoph Koch 0001
openaire +1 more source