Automated rendering of multi-stranded DNA complexes with pseudoknots
From MaRDI portal
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12) Other nonclassical models of computation (68Q09) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Cites work
- scientific article; zbMATH DE number 1670673 (Why is no real title available?)
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 3047038 (Why is no real title available?)
- A force-directed algorithm that preserves edge-crossing properties
- A graphical criterion of planarity for RNA secondary structures with pseudoknots in Rivas-Eddy class
- A strand graph semantics for DNA-based computation
- An algorithm for straight-line drawing of planar graphs
- Automata, Languages and Programming
- Bemerkungen zum Vierfarbenproblem
- Convex Maps
- Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Four pages are indeed necessary for planar graphs
- Graph Drawing
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
- Planar graphs that need four pages
- RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties
- The book thickness of a graph
This page was built for publication: Automated rendering of multi-stranded DNA complexes with pseudoknots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7013614)
