Fast Low Memory T-Transform: string complexity in linear time and space with applications to Android app store security.

Fast Low Memory T-Transform: string complexity in linear time and space with applications to Android app store security.

This thesis presents flott, the Fast Low Memory T-Transform, the currently fastest and most memory efficient linear time and space algorithm available to compute the string complexity measure T-complexity. The flott algorithm uses 64.3% less memory and in our experiments runs asymptotically 20% fast...

Full description

Bibliographic Details
Main Author: Rebenich, Niko
Other Authors: Neville, Stephen William
Language:English
en
Published: 2012
Subjects:
Kolmogorov complexity
Lempel
Ziv
T-codes
flott
Fast T-decomposition
ftd
mobile computing
Lempel-Ziv complexity
LZ complexity
LZ78
LZ77
LZ76
LZW
normalized information distance
NID
normalized compression distance
NCD
McCreight
Ukkonen
phylogenetics
phylogenetic tree
Gemini
Droiddream
Apple
iOS
iPhone
iPad
mobile phone
open source
Apache License 2.0
Online Access:http://hdl.handle.net/1828/3924

Internet

http://hdl.handle.net/1828/3924

Similar Items