Author:
Alizadeh F.,Karp R. M.,Newberg L. A.,Weisser D. K.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference8 articles.
1. A. Blum, T. Jiang, M. Li, J. Tromp, and M. Yannakakis. Linear approximation of shortest superstrings.Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, pp. 328–336, New Orleans, LA, May 1991. ACM Press, New York.
2. E. Branscomb, T. Slezak, R. Pae, D. Galas, A. V. Carrano, and M. Waterman. Optimizing restriction fragment fingerprinting methods for ordering large genomic libraries.Genomics,8(2), 351–366, October 1990.
3. A. V. Carrano, P. J. de Jong, E. Branscomb, T. Slezak, and B. Watkins. Constructing chromosome- and region-specific cosmid maps of the human genome.Genome,31(2), 1059–1065, 1989.
4. A. G. Craig, D. Nizetic, J. D. Hoheisel, G. Zehetner, and H. Lehrach. Ordering of cosmid clones covering the Herpes simplex virus type-I (HSV-I) genome-a test case for fingerprinting by hybridisation.Nucleic Acids Research,18(9), 2653–2660, May 11, 1990.
5. S. Lin and B. W. Kernighan. An effective heuristic algorithm for the traveling-salesman problem.Operations Research,21(2), March–April 1973.
Cited by
37 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献