June 1, 1975Open Access

A linear space algorithm for computing maximal common subsequences

Puntos clave

Los puntos clave no están disponibles para este artículo en este momento.

Resumen

The problem of finding a longest common subsequence of two strings has been solved in quadratic time and space. An algorithm is presented which will solve this problem in quadratic time and in linear space.

Me gusta

Guardar

Ver artículo completo

Cite This Study

D. S. Hirschberg (Sun,) studied this question.

synapsesocial.com/papers/6a08d3b527ceb0c2a2d60029 https://doi.org/https://doi.org/10.1145/360825.360861

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1Bounds on the complexity of the longest common subsequence problem1974 · 15 citations
2Bounds for the String Editing Problem1976 · 123 citations
3Selected combinatorial research problems.1972 · 77 citations
4The String-to-String Correction Problem1974 · 3,061 citations
5Spelling correction in systems programs1970 · 106 citations

Me gusta

Guardar

Ver artículo completo