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.

Approximate String-Matching over Suffix Trees

Esko Ukkonen. Approximate String-Matching over Suffix Trees. In Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber, editors, Combinatorial Pattern Matching, 4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993, Proceedings. Volume 684 of Lecture Notes in Computer Science, pages 228-242, Springer, 1993.

Abstract

Abstract is missing.

runs on