Selected papers that cite this one
- Tatsuya Akutsu and Satoru Miyano. On the approximation of protein threading. Theoretical Computer Science, 210(2):261-275, 17 January 1999.
- Piotr Berman and Georg Schnitger. On the complexity of approximating the independent set problem. Information and Computation, 96(1):77-94, January 1992.
- Campbell Fraser. Consistent subsequences and supersequences. Theoretical Computer Science, 165(2):233-246, 10 October 1996.
- C. B. Fraser and R. W. Irving. Approximation Algorithms for the Shortest Common Supersequence. Nordic Journal of Computing, 2(3):303-325, Fall 1995.
- Campbell B. Fraser, Robert W. Irving, and Martin Middendorf. Maximal common subsequences and minimal common supersequences. Information and Computation, 124(2):145-153, 1 February 1996.
- W. I. Gasarch, M. W. Krentel, and K. J. Rappoport. OptP as the normal behavior of NP-complete problems. Mathematical Systems Theory, 28(6):487-514, November/December 1995.
- Tirza Hirst and David Harel. Taking it to the limit: On infinite variants of NP-complete problems. Journal of Computer and System Sciences, 53(2):180-193, October 1996.
- Tao Jiang and Ming Li. On the approximation of shortest common supersequences and longest common subsequences. SIAM Journal on Computing, 24(5):1122-1139, October 1995.