MULTI-DIRECTIONAL WIDTH-BOUNDED GEOMETRIC SEPARATOR AND PROTEIN FOLDING
From MaRDI portal
Publication:3607489
DOI10.1142/S0218195908002696zbMATH Open1167.65340OpenAlexW2099368064MaRDI QIDQ3607489FDOQ3607489
Bin Fu, Lizhe Xu, Sorinel Adrian Oprisan
Publication date: 2 March 2009
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195908002696
Recommendations
- Algorithms and Computation
- Geometric Separators and Their Applications to Protein Folding in the HP-Model
- Automata, Languages and Programming
- Sublinear time width-bounded separators and their application to the protein side-chain packing problem
- Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem
Cites Work
- Applications of a Planar Separator Theorem
- A Separator Theorem for Planar Graphs
- On the Problem of Partitioning Planar Graphs
- A framework for solving VLSI graph layout problems
- Title not available (Why is that?)
- A separator theorem for graphs of bounded genus
- Planar Separators
- An application of the planar separator theorem to counting problems
- Reduced constants for simple cycle graph separation
Cited In (6)
- The MIN-cut and vertex separator problem
- Algorithms and Computation
- Geometric Separators and Their Applications to Protein Folding in the HP-Model
- Knowledge Discovery in Graphs Through Vertex Separation
- Balanced line separators of unit disk graphs
- Geometric restrictions on producible polygonal protein chains
This page was built for publication: MULTI-DIRECTIONAL WIDTH-BOUNDED GEOMETRIC SEPARATOR AND PROTEIN FOLDING
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3607489)
