Results 261 to 270 of about 49,235 (305)
The first complete mitochondrial genome of <i>Trichaptum biforme</i> (Fr.) Ryvarden 1972 within the family Trichaptaceae, Hymenochaetales. [PDF]
Wei J +5 more
europepmc +1 more source
Abstract The oval window (OW) is an opening connecting the inner and middle ear. Its area has been shown to consistently scale with body mass (BM) in primates, and has been used alongside semi‐circular canal (SCC) size to differentiate Homo sapiens and fossil hominins, including Paranthropus robustus.
Ruy Fernandez, José Braga
wiley +1 more source
Automated counting of spanning trees for several infinite families of graphs
Pablo Blanco, Doron Zeilberger
doaj +1 more source
The Evolutionary Flexibility of the Drosophila Circadian Clock: Network Constraints or Adaptive Freedom? [PDF]
Creasey LD, Petrov PB, Tauber E.
europepmc +1 more source
Machine learning-driven discovery of host genetic factors for paratuberculosis in goats within the one health framework. [PDF]
Yaman Y +10 more
europepmc +1 more source
Design of anti-frost smoke machine system for mountain orchard based on multi-objective optimization. [PDF]
Lu Y +7 more
europepmc +1 more source
Branching out: Resolving plant evolution through phylogenetic networks
Applications in Plant Sciences, EarlyView.
George P. Tiley, Claudia Solís‐Lemus
wiley +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Graphs and Combinatorics, 2010
This survey does not contain any proofs, only definitions, statements of known results and related open problems, and 195 references. Considered types of spanning trees: with upper bounds on degrees, with upper bounds on the number of leaves or on the number of branch vertices, with small average distance, preserving degrees of as many vertices as ...
Kenta Ozeki, Tomoki Yamashita
exaly +3 more sources
This survey does not contain any proofs, only definitions, statements of known results and related open problems, and 195 references. Considered types of spanning trees: with upper bounds on degrees, with upper bounds on the number of leaves or on the number of branch vertices, with small average distance, preserving degrees of as many vertices as ...
Kenta Ozeki, Tomoki Yamashita
exaly +3 more sources

