论文信息 - Learning a hidden matching

Learning a hidden matching

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))(n/2) upper bound and a nearly matching 0.32(n/2) 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).

[1] Noga Alon,et al. An optimal procedure for gap closing in whole genome shotgun sequencing , 2001, RECOMB.

[2] Vladimir Grebinski,et al. Optimal query bounds for reconstructing a Hamiltonian cycle in complete graphs , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.

[3] C Boileau,et al. Détection des délétions par amplification d'exons (PCR multiplex) dans la myopathie de Duchenne , 1989 .

[4] Vladimir Grebinski,et al. On the Power of Additive Combinatorial Search Model , 1998, COCOON.

[5] S. Salzberg,et al. Optimized multiplex PCR: efficiently closing a whole-genome shotgun sequencing project. , 1999, Genomics.

[6] M Claustres,et al. [Detection of deletions by the amplification of exons (multiplex PCR) in Duchenne muscular dystrophy]. , 1989, Journal de genetique humaine.

[7] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[8] Noga Alon,et al. Learning a Hidden Matching , 2004, SIAM J. Comput..

[9] Vladimir Grebinski,et al. Optimal Reconstruction of Graphs under the Additive Model , 2000, Algorithmica.

[10] Vladimir Grebinski,et al. Reconstructing a Hamiltonian Cycle by Querying the Graph: Application to DNA Physical Mapping , 1998, Discret. Appl. Math..