Sciweavers

163 search results - page 3 / 33
» Tight Approximability Results for Test Set Problems in Bioin...
Sort
View
ALMOB
2006
97views more  ALMOB 2006»
13 years 7 months ago
The approximability of the String Barcoding problem
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...
Giuseppe Lancia, Romeo Rizzi
BIOINFORMATICS
2007
76views more  BIOINFORMATICS 2007»
13 years 7 months ago
Optimization of primer design for the detection of variable genomic lesions in cancer
Primer approximation multiplex PCR (PAMP) is a new experimental protocol for efficiently assaying structural variation in genomes. PAMP is particularly suited to cancer genomes w...
Ali Bashir, Yu-Tsueng Liu, Benjamin J. Raphael, De...
FCS
2007
13 years 9 months ago
Coordinating Planning Agents for Moderately and Tightly-Coupled Tasks
In many task-planning domains, dynamic assemblies of autonomous agents are replacing hierarchical organisations because they promise more agility. In such assemblies, interdepende...
J. Renze Steenhuisen, Cees Witteveen
ACSAC
2003
IEEE
14 years 23 days ago
Intrusion Detection: A Bioinformatics Approach
This paper addresses the problem of detecting masquerading, a security attack in which an intruder assumes the identity of a legitimate user. Many approaches based on Hidden Marko...
Scott E. Coull, Joel W. Branch, Boleslaw K. Szyman...
COLT
2008
Springer
13 years 9 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim