Theory of Computing Systems, Israel Symposium on the (1997)
June 17, 1997 to June 19, 1997
This paper studies four combinatorial search models of reconstructing a fixed unknown Hamiltonian cycle in the complete graph by means of queries about subgraphs. For each model, an efficient algorithm is proposed that matches asymptotically the information-theoretic lower bound. The problem is motivated by an application to genome physical mapping.
G. Kucherov and V. Grebinski, "Optimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs," Theory of Computing Systems, Israel Symposium on the(ISTCS), Ramat-Gan, ISRAEL, 1997, pp. 166.