Main » SPIRE » 2019 » String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7-9, 2019, Proceedings »

On the Computation of Longest Previous Non-overlapping Factors

Enno Ohlebusch, Pascal Weber

Anthology ID:
DBLP:conf/spire/OhlebuschW19
Volume:
String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7-9, 2019, Proceedings
Year:
2019
Venue:
spire_conference
Publisher:
Springer
Pages:
372–381
URL:
https://doi.org/10.1007/978-3-030-32686-9_26
DOI:
10.1007/978-3-030-32686-9_26
DBLP:
conf/spire/OhlebuschW19
BibTeX:
Download 










Google Scholar


Internet Archive Scholar


Semantic Scholar