The Community for Technology Leaders
Green Image
Issue No. 04 - April (2014 vol. 63)
ISSN: 0018-9340
pp: 917-926
Niko Rebenich , Dept. of Electr. & Comput. Eng., Univ. of Victoria, Victoria, BC, Canada
Ulrich Speidel , Dept. of Comput. Sci., Univ. of Auckland, Auckland, New Zealand
Stephen W. Neville , Dept. of Electr. & Comput. Eng., Univ. of Victoria, Victoria, BC, Canada
T. Aaron Gulliver , Dept. of Electr. & Comput. Eng., Univ. of Victoria, Victoria, BC, Canada
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 percent. 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.
INDEX TERMS
Complexity theory, Arrays, Time measurement, Aggregates, Memory management, Algorithm design and analysis
CITATION
Niko Rebenich, Ulrich Speidel, Stephen W. Neville, T. Aaron Gulliver, "FLOTT—A Fast, Low Memory T-TransformAlgorithm for Measuring String Complexity", IEEE Transactions on Computers, vol. 63, no. , pp. 917-926, April 2014, doi:10.1109/TC.2013.29
164 ms
(Ver 3.3 (11022016))