DocumentCode :
2743509
Title :
On the average sequence complexity
Author :
Janson, Svante ; Lonardi, Stefano ; Szpankowski, Wojciech
Author_Institution :
Dept. of Math., Uppsala Univ., Sweden
fYear :
2004
fDate :
23-25 March 2004
Firstpage :
542
Abstract :
This paper discusses the measure of complexity of a sequence called the complexity index. The complexity index captures the "richness of the language" used in a sequence. The measure is simple but quite intuitive. Sequences with low complexity index contain a large number of repeated substrings and they eventually become periodic (e.g., tandem repeats in a DNA sequence). The complexity index is used to characterize the sequence statistically and has a long history of applications in several fields, such as data compression, computational biology, data mining, computational linguistics, among others.
Keywords :
communication complexity; data compression; memoryless systems; sequential codes; average sequence complexity; complexity index; computational biology; computational linguistic; data compression; data mining; periodic sequence; sequence language; sequence statistic; substring; Computational biology; Computational linguistics; DNA; Data compression; Data mining; History; Sequences;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Compression Conference, 2004. Proceedings. DCC 2004
ISSN :
1068-0314
Print_ISBN :
0-7695-2082-0
Type :
conf
DOI :
10.1109/DCC.2004.1281518
Filename :
1281518
Link To Document :
بازگشت