نتایج جستجو برای: relationship tree

تعداد نتایج: 715935  

Estimating urban trees growth, especially tree height is very important in urban landscape management. The aim of the study was to predict of tree height base on tree diameter. To achieve this goal, 921 trees from five species were measured in five areas of Mashhad city in 2014. The evaluated trees were ash tree (Fraxinus species), plane tree (Platanus hybrida), white mulberry (Morus alba), ail...

2011
Dan Graur Weng-Hsiun Li

Phylogeny, the tree of life Essential molecular mechanisms as replication and gene expression were found to be similar among the organisms studied so far. This favors the idea that all present day living organisms have evolved from a common ancestor. The relationship is called phylogeny and is represented by a phylogenetic tree.

2012
Hongling Wang Bukang Wang Guodong Zhou

This paper explores a tree kernel-based method for nominal semantic role labeling (SRL). In particular, a new dependency-driven constituent parse tree (D-CPT) structure is proposed to better represent the dependency relations in a CPT-style structure, which employs dependency relation types instead of phrase labels in CPT. In this way, D-CPT not only keeps the dependency relationship informatio...

2017
Diem Nguyen Johanna Boberg Michelle Cleary Helge Bruelheide Lydia Hönig Julia Koricheva Jan Stenlid

Foliar fungi of silver birch (Betula pendula) in an experimental Finnish forest were investigated across a gradient of tree species richness using molecular high-throughput sequencing and visual macroscopic assessment. We hypothesized that the molecular approach detects more fungal taxa than visual assessment, and that there is a relationship among the most common fungal taxa detected by both t...

Journal: :Data Knowl. Eng. 2006
Qun Chen Andrew Lim Kian Win Ong Jiqing Tang

Existing encoding schemes and index structures proposed for XML query processing primarily target the containment relationship, specifically the parent–child and ancestor–descendant relationship. The presence of preceding-sibling and following-sibling location steps in the XPath specification, which is the de facto query language for XML, makes the horizontal navigation, besides the vertical na...

Journal: :Bioinformatics 1998
Yan P. Yuan Oliver Eulenstein Martin Vingron Peer Bork

MOTIVATION Numerous homologous sequences from diverse species can be retrieved from databases using programs such as BLAST. However, due to multigene families, evolutionary relationship often cannot be easily determined and proper functional assignment becomes difficult. Thus, discrimination between orthologues and paralogues within BLAST output lists of homologous sequences becomes more and mo...

Journal: :J. Applied Probability 2015
Robert J. Elliott Tak Kuen Siu Samuel N. Cohen

Using backward stochastic difference equations (BSDEs), this paper studies dynamic convex risk measures for risky positions in a simple discretetime, binomial tree model. A relationship between BSDEs and dynamic convex risk measures is developed using nonlinear expectations. The time consistency of dynamic convex risk measures is discussed in the binomial tree framework. A relationship between ...

Journal: :Dong wu xue yan jiu = Zoological research 2012
Li Dong Long-Bao Lv Ren Lai

Much attention has been payed to tree shrews for their close phylogenetic relationship with primates, small size, and short reproductive cycle. Especially, they are considered as excellent experiential animals for medicine or/and disease research. A nucleotide sequence encoding neuropeptide Y(NPY) precursor has been cloned from the cDNA library of Tupaia belangeri chinensis. Sequence alignment ...

Journal: :The Journal of General Physiology 2003
Cecil D. Murray

Observation reveals a linear relationship between the logarithm of the circumference of a tree, branch, or leaf stem, and the logarithm of the weight of the tree, branch, or leaf. The bearing of this on the angles of branching in trees is discussed.

1999
Kazuo Iwama Shuichi Miyazaki

Our main result shows that a shortest proof size of tree-like resolution for the pigeonhole principle is superpolynomially larger than that of DAG-like resolution. In the proof of a lower bound, we exploit a relationship between tree-like resolution and backtracking, which has long been recognized in this eld but not been used before to give explicit results.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید