In this paper we present a graph-theoretic formulation of the optimal PLA folding problem. The class of admissible PLA foldings is defined. Necessary and sufficient conditions for obtaining the optimal folding are given. A subproblem of the optimal problem is shown to be NP-complete, and a heuristic algorithm is given which has proven to be effective on a number of test problems.
No takes yet. Share an insight, caveat, or question.
Hachtel et al. (1982) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: