Author:
Bonizzoni Paola,Della Vedova Gianluca,Dondi Riccardo,Mauri Giancarlo
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference11 articles.
1. Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theor. Comput. Sci. 237(1–2), 123–134 (2000)
2. Ausiello, G., Crescenzi, P., Gambosi, V., Kann, G., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin (1999)
3. Chlebík, M., Chlebíková, J.: Complexity of approximating bounded variants of optimization problems. Theor. Comput. Sci. 354(3), 320–338 (2006)
4. Drmanac, R.: cDNA screening by array hybridization. Methods Enzymol. 303, 165–178 (1999)
5. Drmanac, S., Drmanac, R.: Processing of cDNA and genomic kilobase-size clones for massive screening mapping and sequencing by hybridization. Biotechniques 17, 328–336 (1994)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献