EconPapers    
Economics at your fingertips  
 

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

Bin Fu () and Zhixiang Chen ()
Additional contact information
Bin Fu: University of Texas
Zhixiang Chen: University of Texas

Journal of Combinatorial Optimization, 2008, vol. 15, issue 4, No 6, 387-407

Abstract: Abstract Given d>2 and a set of n grid points Q in ℜ d , we design a randomized algorithm that finds a w-wide separator, which is determined by a hyper-plane, in $O(n^{2\over d}\log n)$ sublinear time such that Q has at most $({d\over d+1}+o(1))n$ points on either side of the hyper-plane, and at most $c_{d}wn^{d-1\over d}$ points within $\frac{w}{2}$ distance to the hyper-plane, where c d is a constant for fixed d. In particular, c 3=1.209. To our best knowledge, this is the first sublinear time algorithm for finding geometric separators. Our 3D separator is applied to derive an algorithm for the protein side-chain packing problem, which improves and simplifies the previous algorithm of Xu (Research in computational molecular biology, 9th annual international conference, pp. 408–422, 2005).

Keywords: Sublinear time algorithm; Width-bounded separator; Random sampling (search for similar items in EconPapers)
Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-007-9092-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:15:y:2008:i:4:d:10.1007_s10878-007-9092-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-007-9092-2

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:jcomop:v:15:y:2008:i:4:d:10.1007_s10878-007-9092-2