Author:
Bshouty Nader H.,Mazzawi Hanna
Subject
General Computer Science,Theoretical Computer Science
Reference8 articles.
1. M. Bouvel, V. Grebinski, G. Kucherov, Combinatorial search on graphs motivated by bioinformatics applications: a brief survey, in: WG, 2005, pp. 16–27.
2. S. Choi, J.H. Kim, Optimal query complexity bounds for finding graphs, in: STOC, 2008, pp. 749–758.
3. On a lemma of Littlewood and Offord;Erdös;Bull. Amer. Math. Soc.,1945
4. Optimal reconstruction of graphs under the additive model;Grebinski;Algorithmica,2000
5. Reconstructing a hamiltonian cycle by querying the graph: application to DNA physical mapping;Grebiniski;Discrete Appl. Math.,1998
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献