نتایج جستجو برای: cell characterization

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

2002
Scott D. Russell

DEVELOPMENTAL CONTEXT OF SPERM CELLS ........................................ 190 Structural Characterization ..................................................................... 190 Sperm Dimorphism and Preferential Fertilization .......................................... 191 ISOLATION OF SPERM CELLS ................................................................. 192 Technical Details and P...

Ahmadi Shamsabadi, Tahere, Ayatollahi, Maryam, Azarpira, Negar, Hossein Aghdaei, Mahdokht, Pirjali, Sedighe, Pirjali, Tahere,

Backgrond&Objective: The ability of mesenchymalstem cells (MSCs) differentiation into many cell types, as well as their ex vivo expansion potential, makes them as an attractive therapeutic tool for cell transplantation and tissue engineering. This project was designed to improve isolation culture and characterization of human amniotic membran-derivedMSSCS and human warton ,s jelly- derived MSCs...

M. Tahmoorespur, M.H. Sekhavati S. Yousefi,

Brucellosis, produced by Brucella species, is a disease that causes severe economic losses for livestock farms worldwide Due to serious economic and medical consequences of this disease, many efforts have been made to prevent the infection through the use of recombinant vaccines based on Brucella outer membrane protein (OMP) antigens. In the present study, a wide range of on-line prediction sof...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تهران 1387

چکیده ندارد.

2002
Guillermo Durán

Abstract: The intersection graph of a set of chords on a circle is called a circle graph. This class of graphs admits some interesting subclasses, such as: Helly circle graphs, clique-Helly circle graphs, unit circle graphs and proper circular-arc graphs. In this paper, we prove some inclusion relations among these subclasses. A necessary condition for a graph being a Helly circle graph is show...

Journal: :Random Struct. Algorithms 2010
Michael Krivelevich Reto Spöhel Angelika Steger

In this paper, we compare the offline versions of three Ramsey-type oneplayer games that have been studied in an online setting in previous work: the online Ramsey game, the balanced online Ramsey game, and the Achlioptas game. The goal in all games is to color the edges of the random graph Gn,m according to certain rules without creating a monochromatic copy of some fixed forbidden graph H. Wh...

Journal: :Discrete Mathematics 2009
Sylvain Coulonges Arnaud Pêcher Annegret Wagler

Zhu [15] introduced circular-perfect graphs as a superclass of the well-known perfect graphs and as an important χ-bound class of graphs with the smallest non-trivial χ-binding function χ(G) ≤ ω(G)+1. Perfect graphs have been recently characterized as those graphs without odd holes and odd antiholes as induced subgraphs [4]; in particular, perfect graphs are closed under complementation [7]. In...

Journal: :Discrete Applied Mathematics 2009
Tomás Kaiser

We extend the notion of a minor from matroids to simplicial complexes. We show that the class of matroids, as well as the class of independence complexes, is characterized by a single forbidden minor. Inspired by a recent result of Aharoni and Berger, we investigate possible ways to extend the matroid intersection theorem to simplicial complexes.

Journal: :Discrete Mathematics 2006
Tomás Feder Pavol Hell

Given a symmetric m by m matrix M over 0, 1, ∗, the M -partition problem asks whether or not an input graph G can be partitioned into m parts corresponding to the rows (and columns) of M so that two distinct vertices from parts i and j (possibly with i = j) are nonadjacent if M(i, j) = 0, and adjacent if M(i, j) = 1. These matrix partition problems generalize graph colourings and homomorphisms,...

Journal: :Computer-Aided Design 2008
Hüseyin Erdim Horea T. Ilies

Many diverse engineering problems can be modeled with solid sweeping in a conceptually simple and intuitive way, and sweeps are considered to be one of the basic representation schemes in solid modeling. However, many properties of sweeps as well as their “informational completeness” are not well understood, which is the primary reason why computational support for solid sweeping remains scarce...

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

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