MULTI-DIRECTIONAL WIDTH-BOUNDED GEOMETRIC SEPARATOR AND PROTEIN FOLDING

DOI10.1142/S0218195908002696MaRDI QIDQ3607489zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

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

• scientific article; zbMATH DE number 3077329 (Why is no real title available?)
• A Separator Theorem for Planar Graphs
• A framework for solving VLSI graph layout problems
• A separator theorem for graphs of bounded genus
• An application of the planar separator theorem to counting problems
• Applications of a Planar Separator Theorem
• On the Problem of Partitioning Planar Graphs
• Planar Separators
• Reduced constants for simple cycle graph separation

Cited in

(7)

• Algorithms and Computation
• Geometric Separators and Their Applications to Protein Folding in the HP-Model
• Sublinear time width-bounded separators and their application to the protein side-chain packing problem
• Geometric restrictions on producible polygonal protein chains
• The MIN-cut and vertex separator problem
• Knowledge discovery in graphs through vertex separation
• Balanced line separators of unit disk graphs

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)