Page 89

Miller, W., and E.W. Myers, 1988, "Sequence comparison with concave weighting functions," Bull. Math. Biology 50(2), 97-120.

Miller, W., J. Ostell, and K.E. Rudd, 1990, "An algorithm for searching restriction maps," CABIOS 6,247-252.

Myers, E.W., 1994a, "Approximately Matching Context Free Languages," TR94-22, Department of Computer Science, University of Arizona, Tucson, Ariz.

Myers, E.W., 1994b, "A sublinear algorithm for approximate keywork searching," Algorithmica 12(4), 345-374.

Myers, E.W., and W. Miller, 1988, "Optimal alignments in linear space," CABIOS 4(1), 11-17.

Myers, E.W., and W. Miller, 1989, "Approximate matching of regular expressions," Bull. Math. Biol. 51(1), 5-37.

Sankoff, D., 1975, "Minimal mutation trees of sequences," SIAM Journal of Applied Mathematics 28(1), 35-42.

Smith, T.F., and M.S. Waterman, 1981, "Identification of common molecular sequences," Journal of Molecular Biology 147, 195-197.

Smith, T.F., and W.S. Fitch, 1983, "Optimal sequence alignments," Proceedings of the National Academy of Sciences USA 80, 1382-1386.

Waterman, M.S., and M. Eggert, 1987, "A new algorithm for best subsequence alignments with application to tRNA-rRNA comparisons," Journal of Molecular Biology 197, 723728.

Waterman, M.S., M. Eggert, and E. Lander, 1992, "Parametric sequence comparisons," Proceedings of the National Academy of Sciences USA 89, 6090-6093.

Waterman, M.S., T.F. Smith, and W.A. Beyer, 1976, "Some biological sequence metrics," Advances in Mathematics 20, 367-387.

Zhang, K., and D. Shasha, 1989, "Simple fast algorithms for the editing distance between trees and related problems," SIAM Journal on Computing 18, 1245-1262.



The National Academies | 500 Fifth St. N.W. | Washington, D.C. 20001
Copyright © National Academy of Sciences. All rights reserved.
Terms of Use and Privacy Statement