The protein inference problem represents a major challenge in shotgun proteomics. Here we describe a novel Bayesian approach to address this challenge that incorporates the predict...
Yong Fuga Li, Randy J. Arnold, Yixue Li, Predrag R...
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
XPath is a simple language for navigating an XML-tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment problem for various frag...
We address the problem of multi-UAV surveillance in complex urban environments with occlusions. The problem consists of coordinating the flight of UAVs with on-board cameras so t...
We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same outpu...