Two Lower Bounds for Self-Assemblies at Temperature 1

No abstract is available for this paper.

• Publication year

  2009

• Venue

  International Conferences on Biomedical and Bioinformatics Engineering

• Publication date

  2009-03-08

• Fields of study

  Physics, Computer Science, Mathematics, Engineering, Medicine

• Identifiers
  DOI 10.1089/cmb.2009.0067PMID 20500097
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar, PubMed

• No claims are published for this paper.

• No concepts are published for this paper.

• Limitations of Self-assembly at Temperature One

  2009cited by this paper
• Complexity of Self-Assembled Shapes

  2004cited by this paper
• Algorithmic Self-Assembly of DNA Sierpinski Triangles

  2004cited by this paper
• Combinatorial optimization problems in self-assembly

  2002cited by this paper
• Amorphous computing

  2000cited by this paper
• Logical computation using algorithmic self-assembly of DNA triple-crossover molecules

  2000cited by this paper
• The program-size complexity of self-assembled squares (extended abstract)

  2000influential reference
• Construction, analysis, ligation, and self-assembly of DNA triple crossover complexes

  2000cited by this paper
• Design and self-assembly of two-dimensional DNA crystals

  1998cited by this paper
• DNA nanotechnology: novel DNA constructions.

  1998cited by this paper
• Local Parallel Biomolecular Computation

  1997cited by this paper
• Universal computation via self-assembly of DNA: Some theory and experiments

  1996cited by this paper
• The art and science of self-assembling molecular machines

  1996cited by this paper
• Molecular self-assembly and nanochemistry: a chemical strategy for the synthesis of nanostructures.

  1991cited by this paper

• Proving new directed tile complexity lower bounds at temperature 1 by folding between 2D and just-barely 3D self-assembly

  2024cites this paper
• The role of sequence information in minimal models of molecular assembly

  2024cites this paper
• Self-assembly of and optimal encoding within thin rectangles at temperature-1 in 3D

  2021cites this paper
• Directed Non-Cooperative Tile Assembly Is Decidable

  2021cites this paper
• Improved Lower and Upper Bounds on the Tile Complexity of Uniquely Self-Assembling a Thin Rectangle Non-Cooperatively in 3D

  2020cites this paper
• The program-size complexity of self-assembled paths

  2020influential citation
• Non-cooperatively assembling large structures: a 2D pumping lemma cannot be as powerful as its 1D counterpart

  2019cites this paper
• Powers and Behaviors of Directed Self-assembly

  2019cites this paper
• F eb 2 01 9 Non-cooperatively assembling large structures : a 2 D pumping lemma cannot be as powerful as its 1 D counterpart

  2019cites this paper
• Nearly Constant Tile Complexity for any Shape in Two-Handed Tile Assembly

  2019cites this paper
• New Bounds on the Tile Complexity of Thin Rectangles at Temperature-1

  2018cites this paper
• Self-assembly of, and optimal encoding inside, thin rectangles at temperature-1 in 3D

  2018cites this paper
• DNA Computing and Molecular Programming: 23rd International Conference, DNA 23, Austin, TX, USA, September 24–28, 2017, Proceedings

  2017influential citation
• Particle computation: complexity, algorithms, and logic

  2017cites this paper
• Optimal Program-Size Complexity for Self-Assembled Squares at Temperature 1 in 3D

  2017cites this paper
• The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation

  2017influential citation
• Complexities for High-Temperature Two-Handed Tile Self-assembly

  2017cites this paper
• A Brief Tour of Theoretical Tile Self-Assembly

  2016cites this paper
• Self-Assembly at Temperature 1

  2016cites this paper
• Optimal Self-Assembly of Finite Shapes at Temperature 1 in 3D

  2016cites this paper
• Optimal Self-Assembly of Finite Shapes at Temperature 1 in 3D

  2015cites this paper
• DNA Computing and Molecular Programming

  2015influential citation
• Computing in continuous space with self-assembling polygonal tiles (extended abstract)

  2015cites this paper
• Particle computation: Device fan-out and binary memory

  2015cites this paper
• It's a Tough Nanoworld: in Tile Assembly, Cooperation is not (strictly) more Powerful than Competition

  2015cites this paper
• Simulation in Algorithmic Self-assembly

  2015cites this paper
• Optimal Program-Size Complexity for Self-Assembly at Temperature 1 in 3D

  2014cites this paper
• The Computation Complexity of Temperature-1 Tilings

  2014cites this paper
• Reflections on tiles (in self-assembly)

  2014cites this paper
• Size-separable tile self-assembly: a tight bound for temperature-1 mismatch-free systems

  2014cites this paper
• Non-cooperative Algorithms in Self-assembly

  2014cites this paper
• The Power of Duples (in Self-Assembly): It's Not So Hip to Be Square

  2014cites this paper
• Pattern overlap implies runaway growth in hierarchical tile systems

  2014cites this paper
• Universal Computation with Arbitrary Polyomino Tiles in Non-Cooperative Self-Assembly

  2014cites this paper
• The self-assembly of paths and squares at temperature 1

  2013cites this paper
• Intrinsic universality in tile self-assembly requires cooperation

  2013cites this paper
• A pumping lemma for non-cooperative self-assembly

  2013cites this paper
• An introduction to tile-based self-assembly and a survey of recent results

  2012cites this paper
• Theory of algorithmic self-assembly

  2012cites this paper
• The power of nondeterminism in self-assembly

  2010cites this paper
• Limitations of Self-assembly at Temperature One

  2009cites this paper
• Bounds on the tile complexity of shapes in self-assembly systems

  2009cites this paper
• Temperature 1 self-assembly: deterministic assembly in 3D and probabilistic assembly in 2D

  2009cites this paper
• Limitations of self-assembly at temperature 1

  2009cites this paper
• The challenge of programming molecules

  year unknowncites this paper