Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(4)
Cell Cycle
Computer Simulation
Network Model
Numerical Simulation
Subscribe
Academic
Publications
Modeling of chromosome intermingling by partially overlapping uniform random polygons
Modeling of chromosome intermingling by partially overlapping uniform random polygons,10.1007/s0028501003388,Journal of Mathematical Biology,T. Bla
Edit
Modeling of chromosome intermingling by partially overlapping uniform random polygons
BibTex

RIS

RefWorks
Download
T. Blackstone
,
R. Scharein
,
B. Borgo
,
R. Varela
,
Y. Diao
,
J. Arsuaga
During the early phase of the
cell cycle
the eukaryotic genome is organized into chromosome territories. The geometry of the interface between any two chromosomes remains a matter of debate and may have important functional consequences. The Interchromosomal
Network model
(introduced by Branco and Pombo) proposes that territories intermingle along their periphery. In order to partially quantify this concept we here investigate the probability that two chromosomes form an unsplittable link. We use the uniform random polygon as a crude model for chromosome territories and we model the interchromosomal network as the common spatial region of two overlapping uniform random polygons. This simple model allows us to derive some rigorous mathematical results as well as to perform computer simulations easily. We find that the probability that one uniform random polygon of length n that partially overlaps a fixed polygon is bounded below by $${1O(\frac{1}{\sqrt n})}$$. We use numerical simulations to estimate the dependence of the linking probability of two uniform random polygons (of lengths n and m, respectively) on the amount of overlapping. The degree of overlapping is parametrized by a parameter $${\epsilon\in [0,1]}$$ such that $${\epsilon=0}$$ indicates no overlapping and $${\epsilon=1}$$ indicates total overlapping. We propose that this dependence relation may be modeled as $${f(\varepsilon, m, n) =1{\frac{a(\epsilon)}{b(\epsilon)\sqrt{mn}+c(\epsilon)}}}$$. Numerical evidence shows that this model works well when $${\epsilon}$$ is relatively large $${(\varepsilon \ge 0.5)}$$. We then use these results to model the data published by Branco and Pombo and observe that for the amount of overlapping observed experimentally the URPs have a nonzero probability of forming an unsplittable link.
Journal:
Journal of Mathematical Biology  J MATH BIOL
, vol. 62, no. 3, pp. 371389, 2011
DOI:
10.1007/s0028501003388
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
www.springerlink.com
)
(
www.springerlink.com
)
(
www.springerlink.com
)
(
www.springerlink.com
)
(
math.uncc.edu
)
More »
References
(40)
Principles of Polymer Chemistry
(
Citations: 4631
)
P. J. Flory
Loop entanglement of semicrystalline polyethylene in amorphous region: Diamond lattice approach
(
Citations: 1
)
Zhonghui Duan
,
Louis N. Howard
Journal:
Journal of Computational Chemistry  JCC
, vol. 20, no. 3, pp. 348353, 1999
Topologically Linked Protein Rings in the Bacteriophage HK97 Capsid
(
Citations: 162
)
William R. Wikoff
,
Lars Liljas
,
Robert L. Duda
,
Hiro Tsuruta
,
Roger W. Hendrix
,
John E. Johnson
Journal:
Science
, vol. 289, no. 5487, pp. 21292133, 2000
Protein Chainmail
(
Citations: 23
)
Robert L. Duda
Journal:
Cell
, vol. 94, no. 1, pp. 5560, 1998
Evidence for the Organization of Chromatin in Megabase Pairsized Loops Arranged along a Random Walk Path in the Human G0/G1 Interphase Nucleus
(
Citations: 54
)
Hiroki Yokota
,
Ger van den Engh
,
John E. Hearst
,
Rainer K. Sachs
,
Barbara J. Trask