Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem

Authors:
Enno Ohlebusch;Simon Gog
Affiliations:
Institute of Theoretical Computer Science, University of Ulm, 89069 Ulm, Germany;Institute of Theoretical Computer Science, University of Ulm, 89069 Ulm, Germany
Venue:
Information Processing Letters
Year:
2010

Citing 6
Cited 2

An efficient algorithm for the All Pairs Suffix-Prefix Problem

Information Processing Letters
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Reducing the space requirement of suffix trees

Software—Practice & Experience
Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Replacing suffix trees with enhanced suffix arrays

Journal of Discrete Algorithms - SPIRE 2002
A taxonomy of suffix array construction algorithms

ACM Computing Surveys (CSUR)

Approximate all-pairs suffix/prefix overlaps

Information and Computation
Least random suffix/prefix matches in output-sensitive time

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching

Quantified Score

Hi-index	0.89

Visualization

Abstract