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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on computers Ročník 63; číslo 4; s. 917 - 926
Hlavní autoři: Rebenich, Niko, Speidel, Ulrich, Neville, Stephen W., Gulliver, T. Aaron
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.04.2014
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.2013.29