"Computing the longest common prefix array based on the Burrows-Wheeler ..."

Timo Beller et al. (2013)

> Home

Details and statistics

DOI: 10.1016/J.JDA.2012.07.007

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jda/BellerGOS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jda/BellerGOS13
Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger:
Computing the longest common prefix array based on the Burrows-Wheeler transform. J. Discrete Algorithms 18: 22-31 (2013)

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.