Fast optimal algorithms for computing all the repeats in a string

S.J. Puglisi, William Smyth, M. Yusufu

Research output: Chapter in Book/Conference paper › Conference paper › peer-review

Original language	English
Title of host publication	Proceedings of the Prague Stringology Conference 2008
Place of Publication	Prague
Publisher	Czech Technical University
Pages	161-169
Volume	N/A
ISBN (Print)	9788001041451
Publication status	Published - 2008
Event	Fast optimal algorithms for computing all the repeats in a string - Czech Technical University, Prague Duration: 1 Jan 2008 → …

Conference	Fast optimal algorithms for computing all the repeats in a string
Period	1/01/08 → …

Cite this

@inproceedings{df7085b4e80d43069f2336cfcafc372d,

title = "Fast optimal algorithms for computing all the repeats in a string",

author = "S.J. Puglisi and William Smyth and M. Yusufu",

year = "2008",

language = "English",

isbn = "9788001041451",

volume = "N/A",

pages = "161--169",

booktitle = "Proceedings of the Prague Stringology Conference 2008",

publisher = "Czech Technical University",

note = "Fast optimal algorithms for computing all the repeats in a string ; Conference date: 01-01-2008",

}

TY - GEN

T1 - Fast optimal algorithms for computing all the repeats in a string

AU - Puglisi, S.J.

AU - Smyth, William

AU - Yusufu, M.

PY - 2008

Y1 - 2008

M3 - Conference paper

SN - 9788001041451

VL - N/A

SP - 161

EP - 169

BT - Proceedings of the Prague Stringology Conference 2008

PB - Czech Technical University

CY - Prague

T2 - Fast optimal algorithms for computing all the repeats in a string

Y2 - 1 January 2008

ER -