Sandbox Reserved 1382

From Proteopedia

(Difference between revisions)
Jump to: navigation, search
Line 5: Line 5:
== Function ==
== Function ==
-
G-actin can be polymerized to form filamentous F-actin. It is involved in cell motility in prokaryotic and eukaryotic cells. It builds a ladder on which the <scene name='77/777702/Actin-tropomyosin-myosin/1'>myosin filament</scene> climbs, which in turn causes muscle contractions and other cell movements. It also maintains structure and makes up some of the cytoskeleton of the cell. It orients cellular processes based on space and time.<ref>doi:10.1146/annurev-biophys-042910-155359</ref>
+
G-actin can be polymerized to form filamentous F-actin. It is involved in cell motility in prokaryotic and eukaryotic cells. It builds a ladder on which the myosin filament climbs, which in turn causes muscle contractions and other cell movements. It also maintains structure and makes up some of the cytoskeleton of the cell. It orients cellular processes based on space and time.<ref>doi:10.1146/annurev-biophys-042910-155359</ref>
== Relevance and applications ==
== Relevance and applications ==
-
'''Engineering Applications 1: Parallel Computation Using Actin Fibers and Myosin II Motors'''
+
'''Parallel Computation Using Actin Fibers and Myosin II Motors'''
Electronic computers are able to follow a linear path to use sequential logic to perform high volumes of operations at respectable speeds. However, given a challenge such as a nondeterministic polynomial time complete (NP-complete) problem, such machines fail to provide the correct answer in a reasonable time. NP-complete problems are defined as mathematical problems that can be solved by a “parallel” Turing machine that can perform many computations simultaneously. In this aspect, modern computers are limited by the heat production and the number of parallel computations they can perform, although the advent of multi-core CPUs partially alleviates the problem.
Electronic computers are able to follow a linear path to use sequential logic to perform high volumes of operations at respectable speeds. However, given a challenge such as a nondeterministic polynomial time complete (NP-complete) problem, such machines fail to provide the correct answer in a reasonable time. NP-complete problems are defined as mathematical problems that can be solved by a “parallel” Turing machine that can perform many computations simultaneously. In this aspect, modern computers are limited by the heat production and the number of parallel computations they can perform, although the advent of multi-core CPUs partially alleviates the problem.

Revision as of 18:47, 1 March 2018

This Sandbox is Reserved from January through July 31, 2018 for use in the course HLSC322: Principles of Genetics and Genomics taught by Genevieve Houston-Ludlam at the University of Maryland, College Park, USA. This reservation includes Sandbox Reserved 1311 through Sandbox Reserved 1430.
To get started:
  • Click the edit this page tab at the top. Save the page after each step, then edit it again.
  • Click the 3D button (when editing, above the wikitext box) to insert Jmol.
  • show the Scene authoring tools, create a molecular scene, and save it. Copy the green link into the page.
  • Add a description of your scene. Use the buttons above the wikitext box for bold, italics, links, headlines, etc.

More help: Help:Editing

Globular Actin

Caption for this structure

Drag the structure with the mouse to rotate

References

  1. doi: https://dx.doi.org/10.2210/rcsb_pdb/mom_2001_7
  2. Dominguez R, Holmes KC. Actin structure and function. Annu Rev Biophys. 2011;40:169-86. doi: 10.1146/annurev-biophys-042910-155359. PMID:21314430 doi:http://dx.doi.org/10.1146/annurev-biophys-042910-155359
  3. Nicolau DV Jr, Lard M, Korten T, van Delft FC, Persson M, Bengtsson E, Mansson A, Diez S, Linke H, Nicolau DV. Parallel computation with molecular-motor-propelled agents in nanofabricated networks. Proc Natl Acad Sci U S A. 2016 Mar 8;113(10):2591-6. doi:, 10.1073/pnas.1510825113. Epub 2016 Feb 22. PMID:26903637 doi:http://dx.doi.org/10.1073/pnas.1510825113
  4. Nicolau DV Jr, Lard M, Korten T, van Delft FC, Persson M, Bengtsson E, Mansson A, Diez S, Linke H, Nicolau DV. Parallel computation with molecular-motor-propelled agents in nanofabricated networks. Proc Natl Acad Sci U S A. 2016 Mar 8;113(10):2591-6. doi:, 10.1073/pnas.1510825113. Epub 2016 Feb 22. PMID:26903637 doi:http://dx.doi.org/10.1073/pnas.1510825113
Personal tools