Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
Background: Despite the current availability of several hundreds of thousands of amino acid sequences, more than 36% of the enzyme activities (EC numbers) defined by the Nomenclat...
Background: MannDB was created to meet a need for rapid, comprehensive automated protein sequence analyses to support selection of proteins suitable as targets for driving the dev...
Carol L. Ecale Zhou, Marisa Lam, Jason Smith, Adam...
This paper presents a new unified subdivision scheme that is defined over a k-simplicial complex in n-D space with k 3. We first present a series of definitions to facilitate top...
There is strong evidence that the current implementation of TCP will perform poorly in future high speed networks. To address this problem many congestion control protocols have b...
Marios Lestas, Andreas Pitsillides, Petros A. Ioan...