Sciweavers

WALCOM
2010
IEEE
206views Algorithms» more  WALCOM 2010»
14 years 7 months ago
Crossings between Curves with Many Tangencies
Let A and B be two families of two-way infinite x-monotone curves, no three of which pass through the same point. Assume that every curve in A lies above every curve in B and that...
Jacob Fox, Fabrizio Frati, János Pach, Rom ...
WALCOM
2010
IEEE
230views Algorithms» more  WALCOM 2010»
14 years 7 months ago
Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions
Abstract. Arc-annotated sequences are useful for representing structural information of RNAs and have been extensively used for comparing RNA structures in both terms of sequence a...
Guillaume Blin, Sylvie Hamel, Stéphane Vial...
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
14 years 7 months ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara