External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Two Algorithms for the Longest Common Subsequence of Three (or More) Strings

Robert W. Irving, Campbell Fraser. Two Algorithms for the Longest Common Subsequence of Three (or More) Strings. In Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber, editors, Combinatorial Pattern Matching, Third Annual Symposium, CPM 92, Tucson, Arizona, USA, April 29 - May 1, 1992, Proceedings. Volume 644 of Lecture Notes in Computer Science, pages 214-229, Springer, 1992.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.

runs on