FLOTT-A Fast, Low Memory T-TransformAlgorithm for Measuring String Complexity

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 t...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computers Vol. 63; no. 4; pp. 917 - 926
Main Authors: Rebenich, Niko, Speidel, Ulrich, Neville, Stephen W., Gulliver, T. Aaron
Format: Journal Article
Language:English
Published: New York IEEE 01.04.2014
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Aggregates
Algorithm design and analysis
Algorithms
algorithms for data and knowledge management
Arrays
Coding theory
Complexity
Complexity theory
computation of transforms
Computer programs
information filtering
information theory
Memory management
Running
Software
State of the art
Strings
Suffix trees
text analysis
Time measurement
ISSN:0018-9340, 1557-9956
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
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.
AbstractList 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.
Author Rebenich, Niko
Speidel, Ulrich
Neville, Stephen W.
Gulliver, T. Aaron
Author_xml – sequence: 1
  givenname: Niko
  surname: Rebenich
  fullname: Rebenich, Niko
  email: niko@ece.uvic.ca
  organization: Dept. of Electr. & Comput. Eng., Univ. of Victoria, Victoria, BC, Canada
– sequence: 2
  givenname: Ulrich
  surname: Speidel
  fullname: Speidel, Ulrich
  email: ulrich@cs.auckland.ac.nz
  organization: Dept. of Comput. Sci., Univ. of Auckland, Auckland, New Zealand
– sequence: 3
  givenname: Stephen W.
  surname: Neville
  fullname: Neville, Stephen W.
  email: sneville@ece.uvic.ca
  organization: Dept. of Electr. & Comput. Eng., Univ. of Victoria, Victoria, BC, Canada
– sequence: 4
  givenname: T. Aaron
  surname: Gulliver
  fullname: Gulliver, T. Aaron
  email: agullive@ece.uvic.ca
  organization: Dept. of Electr. & Comput. Eng., Univ. of Victoria, Victoria, BC, Canada
BookMark eNpd0EFPwyAUAGBiZuI2vXj10sSLMXYCHVCOS-PUpMsO1jOhFGaXtkxoM_fvZc548PTyeF8e770JGHW20wBcIzhDCPLHIpthiJIZ5mdgjAhhMeeEjsAYQpTGPJnDCzDxfgshpBjyMVgt83VRxItoKX3_EOV2H610a90hKuLCyc4b69pFs7Gu7j_aKGShLv3g6m4TvfU_IbPtrtFfdX-4BOdGNl5f_cYpeF8-FdlLnK-fX7NFHiuU0j5mJUoxpaxSkOG0JHJuVKmI5IpqnuoU0UpXjMCSEJ0QaqoSG4QMkYwpw8PbFNyd-u6c_Ry070Vbe6WbRnbaDl4gEpab04SgQG__0a0dXBemCwpyxDhlOKj7k1LOeu-0ETtXt9IdBILieFlRZOJ4WYF5wDcnXGut_yAN_yWMJ98FE3RJ
CODEN ITCOB4
Cites_doi 10.1109/TIT.1977.1055714
10.1109/DCC.2000.838175
10.1137/1.9781611972917.3
10.1137/1.9781611970265
10.1109/ISITA.2010.5649672
10.1145/1497577.1497578
10.1017/CBO9780511574931
10.1109/DCC.2010.68
10.1016/j.jda.2011.02.002
10.1109/TIT.2004.838101
10.1007/s10618-006-0057-3
10.1109/TIT.2005.844059
10.1109/ISIT.1998.708931
10.1109/ISIT.2012.6284014
10.1016/S1570-8667(03)00065-0
10.1002/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O
10.1007/978-3-642-21458-5_4
10.1142/S0219493701000047
10.1145/322234.322237
10.1109/TIT.1978.1055934
10.1109/ICICS.2007.4449642
10.1145/1217856.1217858
10.1049/ip-com:19960551
10.1016/j.jda.2004.08.002
10.1007/s11786-007-0024-4
10.1145/321941.321946
10.1007/BF01206331
10.1109/ITW.2005.1531901
10.1587/transfun.E93.A.1346
10.1049/ip-e.1984.0028
10.1109/TC.2010.188
10.1109/ICICS.2011.6173599
10.1109/DCC.2008.36
10.1109/TIT.1976.1055501
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Apr 2014
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Apr 2014
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
F28
FR3
DOI 10.1109/TC.2013.29
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
ANTE: Abstracts in New Technology & Engineering
Engineering Research Database
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
Engineering Research Database
ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList
Technology Research Database
Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library (IEL) (UW System Shared)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISSN 1557-9956
EndPage 926
ExternalDocumentID 3252916661
10_1109_TC_2013_29
6463379
Genre orig-research
GroupedDBID --Z
-DZ
-~X
.55
.DC
0R~
29I
3EH
3O-
4.4
5GY
5VS
6IK
85S
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABFSI
ABQJQ
ABVLG
ACGFO
ACIWK
ACNCT
AENEX
AETEA
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
E.L
EBS
EJD
HZ~
H~9
IAAWW
IBMZZ
ICLAB
IEDLZ
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
MS~
MVM
O9-
OCL
P2P
PQQKQ
RIA
RIE
RNI
RNS
RXW
RZB
TAE
TN5
TWZ
UHB
UKR
UPT
VH1
X7M
XJT
XOL
XZL
YXB
YYQ
YZZ
ZCG
AAYXX
ABUFD
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
RIG
F28
FR3
ID FETCH-LOGICAL-c186t-7b182667dc0728b5a4fcbc5a9c6e98e816ded750b55e356fdb2f11f5a77cf95e3
IEDL.DBID RIE
ISSN 0018-9340
IngestDate Sun Nov 09 10:20:51 EST 2025
Sun Jun 29 12:31:36 EDT 2025
Sat Nov 29 01:35:36 EST 2025
Wed Aug 27 02:49:02 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 4
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c186t-7b182667dc0728b5a4fcbc5a9c6e98e816ded750b55e356fdb2f11f5a77cf95e3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
PQID 1509179672
PQPubID 85452
PageCount 10
ParticipantIDs proquest_miscellaneous_1520946351
crossref_primary_10_1109_TC_2013_29
ieee_primary_6463379
proquest_journals_1509179672
PublicationCentury 2000
PublicationDate 20140401
PublicationDateYYYYMMDD 2014-04-01
PublicationDate_xml – month: 04
  year: 2014
  text: 20140401
  day: 01
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on computers
PublicationTitleAbbrev TC
PublicationYear 2014
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref15
ref10
ref17
ref16
(ref51) 0
mehta (ref40) 2005
ref19
titchener (ref5) 2004; 64
rebenich (ref12) 2012
aho (ref24) 1974
(ref26) 0
ref46
ref45
yang (ref11) 2005
ref48
nicolescu (ref3) 1998; 1
ref47
ref42
ref41
ref44
ref43
ref49
(ref50) 0
ref7
ref9
ref6
yang (ref28) 2005; 11
ref35
ref34
ref37
ref36
ref31
ref33
ref32
ming (ref20) 2004; 50
yang (ref27) 2003
ref2
ref1
knuth (ref23) 1997
ref39
ref38
ref25
ref22
ref21
kolmogorov (ref30) 1965; 1
titchener (ref18) 2006
(ref52) 0
ref29
yang (ref4) 2005
eimann (ref14) 2008
titchener (ref8) 2001
References_xml – ident: ref31
  doi: 10.1109/TIT.1977.1055714
– year: 0
  ident: ref50
– ident: ref7
  doi: 10.1109/DCC.2000.838175
– ident: ref46
  doi: 10.1137/1.9781611972917.3
– year: 2008
  ident: ref14
  publication-title: Network Event Detection with Entropy Measures
– ident: ref25
  doi: 10.1137/1.9781611970265
– ident: ref15
  doi: 10.1109/ISITA.2010.5649672
– ident: ref22
  doi: 10.1145/1497577.1497578
– year: 0
  ident: ref51
– ident: ref41
  doi: 10.1017/CBO9780511574931
– year: 0
  ident: ref52
– ident: ref33
  doi: 10.1109/DCC.2010.68
– start-page: 520
  year: 2001
  ident: ref8
  article-title: Deterministic Chaos and Information Theory
  publication-title: Proc Data Compression Conf
– year: 2012
  ident: ref12
  publication-title: Fast Low Memory T-Transform String Complexity in Linear Time and Space with Applications to Android App Store Security
– ident: ref39
  doi: 10.1016/j.jda.2011.02.002
– volume: 50
  start-page: 3250
  year: 2004
  ident: ref20
  article-title: The Similarity Metric
  publication-title: IEEE Trans Information Theory
  doi: 10.1109/TIT.2004.838101
– volume: 1
  start-page: 243
  year: 1998
  ident: ref3
  article-title: Uniqueness Theorems for T-Codes
  publication-title: Romanian J Information Science Technology
– year: 1974
  ident: ref24
  publication-title: The Design and Analysis of Computer Algorithms
– start-page: 1551
  year: 2003
  ident: ref27
  article-title: An Improved T-Decomposition Algorithm
  publication-title: Proc Joint Conf Int?l Conf Information Comm and Signal Processing and the Pacific Rim Conf Multimedia
– ident: ref21
  doi: 10.1007/s10618-006-0057-3
– volume: 64
  start-page: 443
  year: 2004
  ident: ref5
  article-title: Deterministic Complexity and Entropy
  publication-title: Fundamenta Informaticae
– year: 1997
  ident: ref23
  publication-title: The Art of Computer Programming Vol 1 Fundamental Algorithms
– ident: ref19
  doi: 10.1109/TIT.2005.844059
– ident: ref6
  doi: 10.1109/ISIT.1998.708931
– ident: ref49
  doi: 10.1109/ISIT.2012.6284014
– ident: ref35
  doi: 10.1016/S1570-8667(03)00065-0
– volume: 1
  start-page: 1
  year: 1965
  ident: ref30
  article-title: Three Approaches to the Quantitative Definition of Information
  publication-title: Problems of Information Transmission
– ident: ref42
  doi: 10.1002/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O
– year: 2005
  ident: ref40
  publication-title: Handbook of Data Structures and Applications
– ident: ref36
  doi: 10.1007/978-3-642-21458-5_4
– ident: ref9
  doi: 10.1142/S0219493701000047
– ident: ref34
  doi: 10.1145/322234.322237
– start-page: 23
  year: 2005
  ident: ref4
  article-title: A T-Decomposition Algorithm with <formula formulatype="inline"><tex Notation="TeX">$O(n\; log\, n)$</tex></formula> Time and Space Complexity
  publication-title: Proc IEEE Int?l Symp Information Theory
– ident: ref32
  doi: 10.1109/TIT.1978.1055934
– ident: ref13
  doi: 10.1109/ICICS.2007.4449642
– ident: ref44
  doi: 10.1145/1217856.1217858
– ident: ref2
  doi: 10.1049/ip-com:19960551
– ident: ref43
  doi: 10.1016/j.jda.2004.08.002
– ident: ref38
  doi: 10.1007/s11786-007-0024-4
– ident: ref47
  doi: 10.1145/321941.321946
– year: 2005
  ident: ref11
  publication-title: Fast String Parsing and Its Application in Information and Similarity Measurement
– ident: ref48
  doi: 10.1007/BF01206331
– ident: ref10
  doi: 10.1109/ITW.2005.1531901
– ident: ref16
  doi: 10.1587/transfun.E93.A.1346
– start-page: 859
  year: 2006
  ident: ref18
  article-title: T-Entropy of EEG/EOG Sensitive to Sleep State
  publication-title: Proc Symp Nonlinear Theory and Application
– ident: ref1
  doi: 10.1049/ip-e.1984.0028
– ident: ref45
  doi: 10.1109/TC.2010.188
– year: 0
  ident: ref26
– ident: ref17
  doi: 10.1109/ICICS.2011.6173599
– ident: ref37
  doi: 10.1109/DCC.2008.36
– volume: 11
  start-page: 1083
  year: 2005
  ident: ref28
  article-title: A Fast T-Decomposition Algorithm
  publication-title: J Universal Computer Science
– ident: ref29
  doi: 10.1109/TIT.1976.1055501
SSID ssj0006209
Score 2.0920677
Snippet 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...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Index Database
Publisher
StartPage 917
SubjectTerms Aggregates
Algorithm design and analysis
Algorithms
algorithms for data and knowledge management
Arrays
Coding theory
Complexity
Complexity theory
computation of transforms
Computer programs
information filtering
information theory
Memory management
Running
Software
State of the art
Strings
Suffix trees
text analysis
Time measurement
Title FLOTT-A Fast, Low Memory T-TransformAlgorithm for Measuring String Complexity
URI https://ieeexplore.ieee.org/document/6463379
https://www.proquest.com/docview/1509179672
https://www.proquest.com/docview/1520946351
Volume 63
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE/IET Electronic Library (IEL) (UW System Shared)
  customDbUrl:
  eissn: 1557-9956
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0006209
  issn: 0018-9340
  databaseCode: RIE
  dateStart: 19680101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dT-QgEJ-ouQd9OM-vuKdnMN6j6FJaKI-bjZt7WM0l1sS3BuigJro1u9277H8vsO2eib7cUylQIDMd-A0MMwA_vVbltOacSoucekitaa4sp5iY1CCmIjExaslY3tzk9_fq9xqcr-7CIGI0PsOLkIxn-VVt52Gr7FKkgnOp1mFdSrG8q7WadUVnzsG8APO037oiZX11WQyDCRe_iDDy3-ITo6l8mILjujLa_r8RfYOvLX4kgyXDd2ANJ7uw3cVmIK2o7sLWO0eDe3A9GnvVnQ7ISM-aczKu_5LrYGK7IAUtOug6eH6op0_N4wvxb748bB76r8ltEx-hj-A9s1nsw93oqhj-om0gBWpZLhoqTdAihKxsXya5yXTqrLGZVlagyjFnosLKQweTZcgz4SqTOMZcpqW0Tvm8A9iY1BM8BGKsZpah4FLz1KM3JR06bqVGpm3iTA_OOgqXr0t_GWXUM_qqLIZl4EOZqB7sBVquarRk7MFxx4yyFaVZyQKkkUrIpAenq2IvBOFkQ0-wnoc6nvu-jYx9_7zlI9j0XbcmN8ew0Uzn-AO-2D_N02x6Ev-kNzNSyGI
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dTxQxEJ8gmCgPoqDxALVGHylct7vt9vFy8QJx72LimvC2abtTJIFbc7cH4b-nLbunibzwtB_9zEyn_U07nQH46rUqpzXnVFrk1ENqTXNlOcXEpAYxFYmJUUsKOZvl5-fqxwYcre_CIGI0PsPj8BrP8uvGrsJW2YlIBedSPYOtEDmru621nndFb9DBvAjzdNg5I2VDdVKOgxEXP45A8u_yE-Op_DcJx5VlsvO0Pr2GVx2CJKMHlr-BDZzvwk4fnYF0wroL2_-4GtyD6aTwyjsdkYletkekaG7JNBjZ3pGSlj14HV1dNIvL9vc18V8-PWwf-tLkZxsfoY3gP7O9ewu_Jt_K8SntQilQy3LRUmmCHiFkbYcyyU2mU2eNzbSyAlWOORM11h48mCxDnglXm8Qx5jItpXXK_3sHm_Nmju-BGKuZZSi41Dz1-E1Jh45bqZFpmzgzgC89has_Dx4zqqhpDFVVjqvAhypRA9gLtFzn6Mg4gMOeGVUnTMuKBVAjlZDJAD6vk70YhLMNPcdmFfJ47vs6Mrb_eM2f4MVpOS2q4mz2_QBe-m50BjiHsNkuVvgBntub9nK5-BhH1T3M88ur
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=FLOTT--A+Fast%2C+Low+Memory+T-TransformAlgorithm+for+Measuring+String+Complexity&rft.jtitle=IEEE+transactions+on+computers&rft.au=Rebenich%2C+Niko&rft.au=Speidel%2C+Ulrich&rft.au=Neville%2C+Stephen+W&rft.au=Gulliver%2C+T.+Aaron&rft.date=2014-04-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=0018-9340&rft.eissn=1557-9956&rft.volume=63&rft.issue=4&rft.spage=917&rft_id=info:doi/10.1109%2FTC.2013.29&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=3252916661
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9340&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9340&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9340&client=summon