TY - JOUR
T1 - Learning a hidden matching
AU - Alon, Noga
AU - Beigel, Richard
AU - Kasif, Simon
AU - Rudich, Steven
AU - Sudakov, Benny
PY - 2002
Y1 - 2002
N2 - We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of vertices induces an edge. This is motivated by a problem that arises in molecular biology. In the deterministic nonadaptive setting, we prove a (1/2 + o(1)) (2n) upper bound and a nearly matching 0.32 (2n) lower bound for the minimum possible number of queries. In contrast, if we allow randomness then we obtain (by a randomized, nonadaptive algorithm) a much lower O(n log n) upper bound, which is best possible (even for randomized fully adaptive algorithms).
AB - We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of vertices induces an edge. This is motivated by a problem that arises in molecular biology. In the deterministic nonadaptive setting, we prove a (1/2 + o(1)) (2n) upper bound and a nearly matching 0.32 (2n) lower bound for the minimum possible number of queries. In contrast, if we allow randomness then we obtain (by a randomized, nonadaptive algorithm) a much lower O(n log n) upper bound, which is best possible (even for randomized fully adaptive algorithms).
UR - http://www.scopus.com/inward/record.url?scp=0036953747&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???
AN - SCOPUS:0036953747
SN - 0272-5428
SP - 197
EP - 206
JO - Annual Symposium on Foundations of Computer Science - Proceedings
JF - Annual Symposium on Foundations of Computer Science - Proceedings
T2 - The 34rd Annual IEEE Symposium on Foundations of Computer Science
Y2 - 16 November 2002 through 19 November 2002
ER -