An efficient algorithm for the All Pairs Suffix-Prefix Problem

Apostolico, 1988, Parallel construction of a suffix tree with applications, Algorithmica, 3, 347, 10.1007/BF01762122

Blum, 1991, Linear approximation of shortest superstrings, Proc. 23rd ACM Symp. on Theory of Computing, 328

Kececioglu, 1989, A procedural interface for a fragment assembly tool

Kececioglu, 1991, A robust and automatic fragment assembly system

Knuth, 1977, Fast pattern matching in strings, SIAM J. Comput., 6, 323, 10.1137/0206024

1988

McCreight, 1976, A space-economical suffix tree construction algorithm, J. ACM, 23, 262, 10.1145/321941.321946

Tarhio, 1988, A greedy approximation algorithm for constructing shortest common superstrings, Theoret. Comput. Sci., 57, 131, 10.1016/0304-3975(88)90167-3

Tarjan, 1983, Data Structures and Network Algorithms

Turner, 1989, Approximation algorithms for the shortest common superstring problem, Inform. and Comput., 83, 1, 10.1016/0890-5401(89)90044-8

Ukkonen, 1990, A linear time algorithm for finding approximate shortest common superstrings, Algorithmica, 5, 313, 10.1007/BF01840391

Weiner, 1973, Linear pattern matching algorithm, Proc. 14th IEEE Symp. on Switching and Automata Theory, 1, 10.1109/SWAT.1973.13