"An Efficient Algorithm for the All Pairs Suffix-Prefix Problem."

Dan Gusfield, Gad M. Landau, Baruch Schieber (1992)

> Home

Details and statistics

DOI: 10.1016/0020-0190(92)90176-V

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/GusfieldLS92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/GusfieldLS92
Dan Gusfield, Gad M. Landau, Baruch Schieber:
An Efficient Algorithm for the All Pairs Suffix-Prefix Problem. Inf. Process. Lett. 41(4): 181-185 (1992)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.