Results 211 to 220 of about 429,086 (268)

Diversity of myxomycetes on twig litter from various canopy trees in a mid-temperate natural forest in western Japan. [PDF]

Mycoscience
Takahashi K, Minami K.
europepmc   +1 more source

Tree structural modeling from leaf-on point clouds for biomass carbon stock estimation. [PDF]

Sci Rep
Nakamura Y, Yamazaki T, Shirakawa H, Tanikawa H, Nagao M.   +4 more
europepmc   +1 more source

A Hadza-enriched <i>Prevotella/Segatella</i> xyloglucanase shows sequence conservation and functional specialization. [PDF]

Gut Microbes Rep
Louise Jespersen M, Kjærgaard Munk K, Fjermedal S, Pilgaard B, Meyer AS, Aarestrup FM, Otani S.   +6 more
europepmc   +1 more source

Multi-sensor microclimate and tree canopy dataset from a linden tree for green infrastructure validation. [PDF]

Sci Data
Schöneberger P, Sinsel T, Simon H, Bruse M.   +3 more
europepmc   +1 more source

Ancient oaks reveal rewilding of Mediterranean forests after the Black Death. [PDF]

Proc Natl Acad Sci U S A
Piovesan G, Baliva M, Biondi F, Palli J, Calcagnile L, Chiarucci A, Manicone R, Quarta G, Quilghini G, Siclari A, Cannon CH.   +10 more
europepmc   +1 more source

THE TREE OF TUPLES OF A STRUCTURE

The Journal of Symbolic Logic, 2020
AbstractOur main result is that there exist structures which cannot be computably recovered from their tree of tuples. This implies that there are structures with no computable copies which nevertheless cannot code any information in a natural/functorial way.
Matthew Harrison-Trainor, Antonio Montalbán   +1 more
openaire   +2 more sources

On Torsor Structures on Spanning Trees

SIAM Journal on Discrete Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Farbod Shokrieh, Cameron Wright
openaire   +2 more sources

Trees with structure

Journal of Mathematical Psychology, 1973
Abstract We investigate M -trees, that is, trees with structure possible at each node or level. M is a mathematical structure such as a set or a Cartesian product. An extension of Polya's theorem is proved which allows the number of M -trees for a given number of nodes to be counted. The special case of componential trees is investigated. Here M
Boyd, John Paul, Wexler, Kenneth N.
openaire   +2 more sources