1. Alon N, Asodi V (2004) Learning a hidden subgraph. In: ICALP. LNCS, vol 3142, pp 110–121; Also: SIAM J Discr Math 18:697–712 (2005)
2. Alon N, Beigel R, Kasif S, Rudich S, Sudakov B (2002) Learning a hidden matching. In: Proceedings of the 43rd IEEE FOCS, pp 197–206; Also: SIAM J Comput 33:487–501 (2004)
3. Beigel R, Alon N, Apaydin MS, Fortnow L, Kasif S (2001) An optimal procedure for gap closing in whole genome shotgun sequencing. In: Proceedings of RECOMB. ACM, pp 22–30
4. Burgart LJ, Robinson RA, Heller MJ, Wilke WW, Iakoubova OK, Cheville JC (1992) Multiplex polymerase chain reaction. Mod Pathol 5:320–323
5. Grebinski V, Kucherov G (1997) Optimal query bounds for reconstructing a Hamiltonian cycle in complete graphs. In: Proceedings of 5th Israeli symposium on theoretical computer science, pp 166–173