Sublinear time width-bounded separators and their application to the protein side-chain packing problem

DOI10.1007/s10878-007-9092-2zbMath1181.68325OpenAlexW1996715732MaRDI QIDQ927195

Bin Fu, Zhixiang Chen

Publication date: 4 June 2008

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-007-9092-2

zbMATH Keywords

Random samplingSublinear time algorithmWidth-bounded separator

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Randomized algorithms (68W20)

Related Items (2)

Separating sublinear time computations by approximate diameter ⋮ Separating Sublinear Time Computations by Approximate Diameter

Cites Work

• Reduced constants for simple cycle graph separation
• A PTAS for a disc covering problem using width-bounded separators
• A Semidefinite Programming Approach to Side Chain Positioning with New Rounding Strategies
• On the closest string and substring problems
• A separator theorem for graphs of bounded genus
• A Separator Theorem for Planar Graphs
• On the Problem of Partitioning Planar Graphs
• Theory and Application of Width Bounded Geometric Separator
• Automata, Languages and Programming
• Research in Computational Molecular Biology
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sublinear time width-bounded separators and their application to the protein side-chain packing problem