An efficient algorithm for the All Pairs Suffix-Prefix Problem

This publication has 7 references indexed in Scilit:

• A linear-time algorithm for finding approximate shortest common superstrings
  Algorithmica, 1990
• Approximation algorithms for the shortest common superstring problem
  Information and Computation, 1989
• Parallel construction of a suffix tree with applications
  Algorithmica, 1988
• A greedy approximation algorithm for constructing shortest common superstrings
  Theoretical Computer Science, 1988
• Fast Pattern Matching in Strings
  SIAM Journal on Computing, 1977
• A Space-Economical Suffix Tree Construction Algorithm
  Journal of the ACM, 1976
• Linear pattern matching algorithms
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1973