Optimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs

  title={Optimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs},
  author={Vladimir Grebinski and Gregory Kucherov},
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. Th e problem is motivated by an application to genome physical mapping. 

From This Paper

Figures, tables, and topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 19 references

Determining subsets by unramified exper iments

  • B. Lindström
  • J. Srivastava, editor, A Surveyof Statistical…
  • 1975
Highly Influential
5 Excerpts


  • A. Sorokin, A. Lapidus, V. Capuano, N. Galleron
  • Puji c, and S. D. Ehrlich. A new approach using…
  • 1996
2 Excerpts

Reconstructing a hamilton an circuit by querying the graph: Application to DNA physical mapping

  • V. Grebinski, G. Kucherov
  • IR 96-R-123, Centre de Recherche en Informatique…
  • 1996
3 Excerpts

Introduction to Computational Molecular Biology

  • M. S. Waterman
  • Maps, sequences et genomes . Chapman & Hill
  • 1995
1 Excerpt

and D

  • W. Bruno, E. Knill, +5 authors C. Whittaker
  • Torney. Efficient pooling designs for library…
  • 1995
1 Excerpt

and M

  • E. Port, F. Sun, D. Martin
  • Waterman. Genomic mapping by end-characterized…
  • 1995
1 Excerpt

Hwang.Combinatorial Group Testing and its applications

  • F.K.D.-Z. Du
  • ofSeries on applied mathematics. WorldScientific,
  • 1993
2 Excerpts


  • J. H. Dinitz, D. R. Stinson
  • ContemporaryDesign Theory. John Wiley & Sons
  • 1992

Similar Papers

Loading similar papers…