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

@article{Ohlebusch2010EfficientAF,
  title={Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem},
  author={Enno Ohlebusch and Simon Gog},
  journal={Inf. Process. Lett.},
  year={2010},
  volume={110},
  pages={123-128}
}
Gusfield et al. [2,3] devised an optimal O (n + m2) time algorithm for solving the following problem: Given m strings S1, S2, . . . , Sm of total length n, the all-pairs suffixprefix matching problem is the problem of finding, for all j = k with 1 j m and 1 k m, the longest suffix of S j which is a prefix of Sk . Their algorithm uses a generalized suffix tree of the input strings. Suffix trees play a prominent role in algorithmics, but they suffer from two drawbacks: 
12 Citations
9 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 12 extracted citations

References

Publications referenced by this paper.
Showing 1-9 of 9 references

A taxonomy of suffix array construction algorithms

  • W. Smyth Puglisi, A. Turpin
  • Science
  • 1993

An efficient algorithm for the all pairs suffix - prefix problem

  • G. Landau Gusfield, B. Schieber
  • Inform . Process . Lett .

Similar Papers

Loading similar papers…