Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping

Discrete Applied Mathematics

Volumn 88, Issue 1-3, 1998, Pages 147-165

  Grebinski, Vladimir ^a   Kucherov, Gregory ^a  

^a INRIA   (France)

Author keywords

Algorithms; Asymptotic complexity; Combinatorial group testing; Genome physical mapping

Indexed keywords

EID: 0012576326     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00070-5     Document Type: Article

References (20)

1. M. Aigner, Combinatorial Search, Wiley, New York, 1988.
2. T. Beth, D. Jungnickel, H. Lenz, Design Theory, Cambridge University Press, Cambridge, 1986.
3. D.G. Cantor, W.H. Mills, Determination of a subset from certain combinatorial properties, Can. J. Math. 18 (1966) 42-48.
4. J.H. Dinitz, D.R. Stinson (Eds.), Contemporary Design Theory, Wiley, New York, 1992.
5. D.-Z. Du, F.K. Hwang, Combinatorial Group Testing and its Applications, Series on Applied Mathematics, vol. 3, World Scientific, Singapore, 1993.
6. P. Erdös, A. Rényi, On two problems of information theory, Publ. Hungar. Acad. Sci. 8 (1963) 241-254.
7. V. Grebinski, G. Kucherov, Optimal reconstruction of graphs under the additive model, in R. Burkard, G. Woeginger (Eds.), Proc. Ann. European Symp. on Algorithms (ESA'97), Lecture Notes on Computer Science, Springer, Berlin, 1997, pp. 246-258.
8. M. Hall, Combinatorial Theory, Blaisdell, New York, 1967.
9. F.K. Hwang, A tale of two coins, Amer. Math. Monthly 94 (1987) 121-129.
10. E. Knill, Lower bounds for identifying subset members with subset queries, in Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms (SODA), 1995, pp. 369-377.
11. E. Knill, S. Muthukrishnan, Group testing problems in experimental molecular biology. Technical Report LAUR-95-1503, Los Alamos National Laboratory, March 1995.
12. M. Li, P. Vitányi, Kolmogorov complexity arguments in combinatorics, J. Combin. Theory Ser. A 66 (1994) 226-236.
13. B. Lindström, On a combinatorial problem in number theory, Canad. Math. Bull. 8 (1965) 477-490.
14. B. Lindström, Determination of two vectors from the sum, J. Combin. Theory A6 (1969) 402-407.
15. B. Lindström, Determining subsets by unramified experiments, in: J.N. Srivastava (Ed.), A Survey of Statistical Designs and Linear Models, North-Holland, Amsterdam, 1975, pp. 407-418.
16. C.J. Mozzochi, On the difference between consecutive primes, J. Number Theory 24 (1986) 181-187.
17. E. Port, F. Sun, D. Martin, M. Waterman, Genomic mapping by end-characterized random clones: A mathematical analysis, Genomics 26 (1995) 84-100.
18. V. Rödl, On a packing and covering problem, European J. Combin. 5 (1985) 69-78.
19. A. Sorokin, A. Lapidus, V. Capuano, N. Galleron, P. Pujic, S.D. Ehrlich, A new approach using multiplex long accurate PCR and yeast artificial chromosomes for bacterial chromosome mapping and sequencing, Genome Res. 6 (1996) 448-453.
20. M.S. Waterman, Introduction to Computational Molecular Biology. Maps, Sequences and Genomes, Chapman & Hill, New York, 1995.