论文信息 - Lazy Dynamic-Programming Can Be Eager - 字舞流文

Lazy Dynamic-Programming Can Be Eager

Abstract Lazy evaluation in a functional language is exploited to make the simple dynamic-programming algorithm for the edit-distance problem run quickly on similar strings: being lazy can be fast.

Lloyd Allison | L. Allison

[1] Eugene W. Myers,et al. A file comparison program , 1985, Softw. Pract. Exp..

[2] Esko Ukkonen,et al. On Approximate String Matching , 1983, FCT.

[3] Simon L. Peyton Jones,et al. The Implementation of Functional Programming Languages , 1987 .

[4] Michael J. Fischer,et al. The String-to-String Correction Problem , 1974, JACM.

[5] Eugene W. Myers,et al. Row replacement algorithms for screen editors , 1989, TOPL.

[6] Lloyd Allison. Circular programs and self‐referential structures , 1989, Softw. Pract. Exp..

[7] Peter H. Sellers,et al. An Algorithm for the Distance Between Two Finite Sequences , 1974, J. Comb. Theory, Ser. A.

[8] David Sankoff,et al. Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison , 1983 .