1. Z. Abrams, H.L. Chen, The Simplified Partial Digest Problem: Hardness and a probabilistic analysis, in: RECOMB Satellite Meeting on DNA Sequencing Technologies and Computation, 2004
2. Complexity and Approximation: Combinatorial Optimization Problems and their Approximability Properties;Ausiello,1999
3. The simplified partial digest problem: Enumerative and dynamic programming algorithms;Blazewicz;IEEE/ACM Transactions on Computational Biology and Bioinformatics,2007
4. J. Blazewicz, E.K. Burke, M. Kasprzak, A. Kovalev, M.Y. Kovalyov, The Simplified Partial Digest Problem: Approximation and a graph-theoretic model (submitted for publication)
5. Construction of DNA restriction maps based on a simplified experiment;Blazewicz;Bioinformatics,2001