Reconstructing a Hamiltonian Cycle by Querying the Graph: Application to DNA Physical Mapping - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 1998

Reconstructing a Hamiltonian Cycle by Querying the Graph: Application to DNA Physical Mapping

Vladimir Grebinski
  • Fonction : Auteur
  • PersonId : 755985
  • IdRef : 193209039

Résumé

This paper studies four mathematical models of the multiplex PCR method of genome physical mapping described in \cite{Sorokin1}. The models are expressed as combinatorial group testing problems of finding an unknown Hamiltonian cycle in the complete graph by means of queries of different type. For each model, an efficient algorithm is proposed that matches asymptotically the information-theoretic lower bound.

Domaines

Autre [cs.OH]
Fichier non déposé

Dates et versions

inria-00098545 , version 1 (25-09-2006)

Identifiants

  • HAL Id : inria-00098545 , version 1

Citer

Vladimir Grebinski, Gregory Kucherov. Reconstructing a Hamiltonian Cycle by Querying the Graph: Application to DNA Physical Mapping. Discrete Applied Mathematics, 1998, 88 (1-3), pp.147-165. ⟨inria-00098545⟩
76 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More