Main » SPIRE » 2011 » String Processing and Information Retrieval, 18th International Symposium, SPIRE 2011, Pisa, Italy, October 17-21, 2011. Proceedings »

Computing the Longest Common Prefix Array Based on the Burrows-Wheeler Transform

Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger


Anthology ID:
DBLP:conf/spire/BellerGOS11
Volume:
String Processing and Information Retrieval, 18th International Symposium, SPIRE 2011, Pisa, Italy, October 17-21, 2011. Proceedings
Year:
2011
Venue:
spire_conference
Publisher:
Springer
Pages:
197–208
URL:
https://doi.org/10.1007/978-3-642-24583-1_20
DOI:
10.1007/978-3-642-24583-1_20
DBLP:
conf/spire/BellerGOS11
BibTeX:
Download