Minimal parallelism was recently introduced [3] as a way the rules of a P system are used: from each set of applicable rules associated to the same membrane, at least one must be a...
3 Motivated by the works of Ngo and Du [H. Ngo, D. Du, A survey on combinatorial group testing 4 algorithms with applications to DNA library screening, DIMACS Series in Discrete Ma...
Many basic tasks in computational biology involve operations on individual DNA and protein sequences. These sequences, even when anonymized, are vulnerable to re-identification a...
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...
Background: DNA-binding proteins are of utmost importance to gene regulation. The identification of DNA-binding domains is useful for understanding the regulation mechanisms of DN...