In this presentation, we developed an algorithm for describing the bending structure of myxobacteria...
Download
1 / 10

Algorithm for bending structure of Myxobacteria Nan Chen and Yilin Wu - PowerPoint PPT Presentation


  • 64 Views
  • Uploaded on

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' Algorithm for bending structure of Myxobacteria Nan Chen and Yilin Wu' - kenton


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

In this presentation, we developed an algorithm for describing the bending structure of myxobacteria. In this algorithm, cell structure is presented by key nodes and connection bonds. System potential energy includes stretching energy and bonding energy. Cell collision is implemented by a MC algorithm. Further development is still in progress.


Algorithm for bending structure of Myxobacteria describing the bending structure of myxobacteria. In this algorithm, cell structure is presented by key nodes and connection bonds. System potential energy includes stretching energy and bonding energy. Cell collision is implemented by a MC algorithm. Further development is still in progress.

Nan Chen and Yilin Wu


Algorithm Description describing the bending structure of myxobacteria. In this algorithm, cell structure is presented by key nodes and connection bonds. System potential energy includes stretching energy and bonding energy. Cell collision is implemented by a MC algorithm. Further development is still in progress.

Key nodes are used to describe the flexibility of myxobacteria


Stretching and bending Energy describing the bending structure of myxobacteria. In this algorithm, cell structure is presented by key nodes and connection bonds. System potential energy includes stretching energy and bonding energy. Cell collision is implemented by a MC algorithm. Further development is still in progress.

Stretching Energy

Bending Energy


MonteCarlo Algorithm for cells movement describing the bending structure of myxobacteria. In this algorithm, cell structure is presented by key nodes and connection bonds. System potential energy includes stretching energy and bonding energy. Cell collision is implemented by a MC algorithm. Further development is still in progress.

Algorithm for one MC step

For I = 1 to n-1

Randomly choose one node

Randomly choose one moving direction and distance

If (Collision happen)

Not accepted and next

Calculate energy change

Calculate acceptance probability

if (Accpted)

update configuration


Algorithm for cells collision describing the bending structure of myxobacteria. In this algorithm, cell structure is presented by key nodes and connection bonds. System potential energy includes stretching energy and bonding energy. Cell collision is implemented by a MC algorithm. Further development is still in progress.

Turn to this direction


Why we choose MC algorithm, not deterministic algorithm (MD)?

  • Advantage

  • MC Algorithm could easily handle verycomplicated cell configurations

  • MC algorithm allows cells still to move when cell lock happens

  • Disadvantage

  • MC algorithm is slower than deterministic algorithm


Algorithm of adding slime field
Algorithm of Adding slime field (MD)?

  • The cell “searches” the slime field in front of S-end. Sum all the slimes in the N areas (as shown in next slide) respectively, denoting by S(i), i= 1,…N;

  • The probability to choose one of the N directions (as shown in next slide) is proportional to the slime concentrations in the N areas:

  • The 2D surface was already mapped into 2D lattice. I create a slime field on this lattice;

  • In every time step, each cell deposits slimes by adding 1 slime to each lattice site occupied by the A-end;

  • In every time step, before moving a cell, specify the position O(x, y) of the its S-end or head;


3 (MD)?

Y

2

1

Search area

Y’

S end

N-1

X’

n

A end

Moving direction

X

Slime distribution

f(x)

90

-90


Summary
Summary (MD)?

  • Further work to integrate both the cell-cell interactions and slime field.


ad