Results 321 to 330 of about 4,210,592 (370)

Mechanical Pruning Induces Distinct Metabolic Responses in Slender Spindle-Shaped Apple Orchards. [PDF]

open access: yesPlants (Basel)
Park J   +8 more
europepmc   +1 more source

Positive Drought Feedbacks Increase Tree Mortality Risk in Dry Woodlands of the US Southwest. [PDF]

open access: yesEcol Evol
Rodman KC   +7 more
europepmc   +1 more source

“Tree Tree Tree”

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

Rooting Species Trees Using Gene Tree-Species Tree Reconciliation

2022
Interpreting phylogenetic trees requires a root, which provides the direction of evolution and polarizes ancestor-descendant relationships. But inferring the root using genetic data is difficult, particularly in cases where the closest available outgroup is only distantly related, which are common for microbes.
Brogan J, Harris   +5 more
openaire   +2 more sources

Proof Tree Preserving Tree Interpolation

Journal of Automated Reasoning, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jürgen Christ, Jochen Hoenicke
openaire   +3 more sources

Tree by Tree

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

TREES, TREES, SO MANY TREES

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

Home - About - Disclaimer - Privacy