Monte Carlo Algorithm for Simulating Reversible Aggregation of Multisite Particles

Biology – Quantitative Biology – Quantitative Methods

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

8 pages, 3 figures

Scientific paper

10.1103/PhysRevE.83.056701

We present an efficient and exact Monte Carlo algorithm to simulate reversible aggregation of particles with dedicated binding sites. This method introduces a novel data structure of dynamic bond tree to record clusters and sequences of bond formations. The algorithm achieves a constant time cost for processing cluster association and a cost between $\mathcal{O}(\log M)$ and $\mathcal{O}(M)$ for processing bond dissociation in clusters with $M$ bonds. The algorithm is statistically exact and can reproduce results obtained by the standard method. We applied the method to simulate a trivalent ligand and a bivalent receptor clustering system and obtained an average scaling of $\mathcal{O}(M^{0.45})$ for processing bond dissociation in acyclic aggregation, compared to a linear scaling with the cluster size in standard methods. The algorithm also demands substantially less memory than the conventional method.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Monte Carlo Algorithm for Simulating Reversible Aggregation of Multisite Particles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Monte Carlo Algorithm for Simulating Reversible Aggregation of Multisite Particles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Monte Carlo Algorithm for Simulating Reversible Aggregation of Multisite Particles will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-519700

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.