Radiation hybrid mapping is a somatic cell technique for ordering human loci along a chromosome and estimating the physical distance between adjacent loci. The present paper considers a realistic model of fragment generation and retention. This model assumes that fragments are generated in the ancestral cell of a clone according to a Poisson breakage process along the chromosome. Once generated...

Common and dwarf bunt of wheat are recognized as being caused by three closely related species, Tilletia caries and T. laevis as common bunt, and T. controversa as dwarf bunt. The morphological characteristics of two species including T. controversa and T. caries were studied from wheat grown in two provinces of Iran, Lorestan and Chaharmahal–o-Bakhtiari duri...

Delayed evaluation and management of penetrating cardiac injuries especially mortar fragments were performed in 30 war victims in the Shahid Rajai Heart Hospital, Tehran. All were men with a mean age of 20.7 years. Pleuritic chest pain was the most common symptom (53.3%), while physical examination was negative in the majority of cases (66.8%). 50 percent of the cases had pericardial effus...

7 Generalized maps are widely used to model the topology of nD objects (such as images) by means of incidence and adjacency relationships between cells (vertices, edges, faces, volumes, ...). In this paper, we introduce distance measures for comparing generalized maps, which is an important issue for image processing and analysis. We introduce a first distance measure which is defined by means ...

The distance between two graphs is usually defined by means of the size of a largest common subgraph. This common subgraph may be an induced subgraph, obtained by removing nodes, or a partial subgraph, obtained by removing arcs and nodes. In this paper, we introduce two soft CSPs which model these two maximum common subgraph problems in a unified framework. We also introduce and compare differe...

When a small pattern graph does not occur inside a larger target graph, we can ask how to find “as much of the pattern as possible” inside the target graph. In general, this is known as the maximum common subgraph problem, which is much more computationally challenging in practice than subgraph isomorphism. We introduce a restricted alternative, where we ask if all but k vertices from the patte...