dutch elm disease is one of the most destructive vascular wilt diseases in the world. ophiosatoma ulmi and o. novo-ulmi had been the most important causal agents of the dutch elm disease in the last century. so, in order to manage of disease, their identification and distinction is necessary. these fungal species were distinguished based on morphological, physiological and molecular characters....

This measure ranges between 0 no overlap and 1 complete overlap, so 0. We investigated the niche breadth and overlap of the fish species occurring in four environments affected by the Coaracy Nunes reservoir, in the Amapá.Individual foraging specialization: niche width versus niche overlap. Sargeant sargeantfiu.edu, Dept of Biology, Georgetown Univ.of these insects, and their trophic niche brea...

PURPOSE To determine the factors that correspond to adenoidal hypertrophy, often prominent in human immunodeficiency virus (HIV)-positive patients. METHODS The sagittal T1-weighted MR images of 21 HIV-positive patients (age range, 25 to 50 years; mean, 37 years) and 21 healthy control subjects (age range, 24 to 55 years; mean, 35 years) were reviewed blindly and independently by two radiologi...

We introduce a new graph width parameter, called special induced matching width, shortly sim-width, which does not increase when taking induced minors. For a vertex partition (A,B) of a graphG, this parameter is based on the maximum size of an induced matching {a1b1, . . . , ambm} in G where a1, . . . , am ∈ A and b1, . . . , bm ∈ B. Classes of graphs of bounded sim-width are much wider than cl...

The rank-width is a graph parameter related in terms of fixed functions to cliquewidth but more tractable. Clique-width has nice algorithmic properties, but no good “minor” relation is known analogous to graph minor embedding for tree-width. In this paper, we discuss the vertex-minor relation of graphs and its connection with rank-width. We prove a relationship between vertex-minors of bipartit...

Robertson and the second author [7] proved in 1986 that for all h there exists f(h) such that for every h-vertex simple planar graph H, every graph with no H-minor has tree-width at most f(h); but how small can we make f(h)? The original bound was an iterated exponential tower, but in 1994 with Thomas [9] it was improved to 2O(h 5); and in 1999 Diestel, Gorbunov, Jensen, and Thomassen [3] prove...