dc.contributor.author |
Rebenich, N |
en |
dc.contributor.author |
Speidel, Ulrich |
en |
dc.contributor.author |
Neville, S |
en |
dc.contributor.author |
Gulliver, Thomas |
en |
dc.date.accessioned |
2018-10-16T22:28:24Z |
en |
dc.date.issued |
2013 |
en |
dc.identifier.issn |
0018-9340 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/42184 |
en |
dc.description.abstract |
This paper presents flott, a fast, low memory T-transform algorithm which can be used to compute the string complexity measure T-complexity. The algorithm uses approximately one third of the memory of its predecessor while reducing the running time by about 20%. The flott implementation has the same worst-case memory requirements as state of the art suffix tree construction algorithms. A suffix tree can be used to efficiently compute the Lempel-Ziv production complexity, which is another measure of string complexity. The C-implementation of flott is available as Open Source software. |
en |
dc.publisher |
IEEE |
en |
dc.relation.ispartofseries |
IEEE Transactions on Computers |
en |
dc.rights |
Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.title |
FLOTT-A Fast, Low Memory T-transform Algorithm for Measuring String Complexity |
en |
dc.type |
Journal Article |
en |
dc.identifier.doi |
10.1109/TC.2013.29 |
en |
pubs.issue |
4 |
en |
pubs.begin-page |
917 |
en |
pubs.volume |
63 |
en |
dc.rights.holder |
Copyright: The author |
en |
pubs.author-url |
http://doi.ieeecomputersociety.org/10.1109/TC.2013.29 |
en |
pubs.end-page |
926 |
en |
dc.rights.accessrights |
http://purl.org/eprint/accessRights/RestrictedAccess |
en |
pubs.subtype |
article |
en |
pubs.elements-id |
408330 |
en |
pubs.org-id |
Science |
en |
pubs.org-id |
School of Computer Science |
en |
pubs.record-created-at-source-date |
2013-11-08 |
en |