Author:
Biedl Therese,Brejová Broňa,Demaine Erik D.,Hamel Angèle M.,López-Ortiz Alejandro,Vinař Tomáš
Subject
General Computer Science,Theoretical Computer Science
Reference27 articles.
1. Battleships variations. Mountain Vista Software. Web page. See http://www.mountainvistasoft.com/variations.htm.
2. R. Beigel, N. Alon, M.S. Apydin, L. Fortnow, An optimal procedure for gap closing in whole genome shotgun sequencing, in: 5th Ann. Internat. Conf. on Computational Molecular Biology (RECOMB), 2001, pp. 22–30.
3. The complexity of coloring games on perfect graphs;Bodlaender;Theoret. Comput. Sci.,1992
4. Prediction of complete gene structures in human genomic DNA;Burge;J. Mol. Biol.,1997
5. L.S. Chandran, A high girth graph construction and a lower bound for hitting set size for combinatorial rectangles, in: 19th Conf. on the Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, Springer, Berlin, Vol. 1738, 1999, pp. 283–290.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献