A dynamic programming algorithm to find all solutions in a neighborhood of the optimum
A dynamic programming algorithm is described whose aim is to give all paths through an acyclic network whose length is within a certain fixed percentage of that of the shortest path. An example is given and is followed by an extensive discussion of the application of the algorithm to a problem of finding distances between biological sequences. This method is compared with some suggested previously with respect to computational and storage requirements.
scientific article; zbMATH DE number 3941289
scientific article