"Computing the Longest Common Prefix Array Based on the Burrows-Wheeler ..."

Timo Beller et al. (2011)

> Home

Details and statistics

DOI: 10.1007/978-3-642-24583-1_20

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/spire/BellerGOS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/spire/BellerGOS11
Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger:
Computing the Longest Common Prefix Array Based on the Burrows-Wheeler Transform. SPIRE 2011: 197-208

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.