Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
Abstract. Consider a system composed of n sensors operating in synchronous rounds. In each round an input vector of sensor readings x is produced, where the i-th entry of x is a bi...
Florent Becker, Sergio Rajsbaum, Ivan Rapaport, Er...
Background: The SEED integrates many publicly available genome sequences into a single resource. The database contains accurate and up-to-date annotations based on the subsystems ...
Terry Disz, Sajia Akhter, Daniel Cuevas, Robert Ol...
Background: Machine learning techniques have shown to improve bacterial species classification based on fatty acid methyl ester (FAME) data. Nonetheless, FAME analysis has a limit...
Bram Slabbinck, Willem Waegeman, Peter Dawyndt, Pa...
Background: We analysed 48 non-redundant antibiotic target proteins from all bacteria, 22 antibiotic target proteins from E. coli only and 4243 non-drug targets from E. coli to id...