Two-dimensional periodicity and its applications
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
Automatic inference of models for statistical code compression
Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
Split-stream dictionary program compression
PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Average case analysis for tree labelling schemes
Theoretical Computer Science
Fast gapped variants for Lempel--Ziv--Welch compression
Information and Computation
Distance measures for biological sequences: Some recent approaches
International Journal of Approximate Reasoning
Computing Longest Previous Factor in linear time and applications
Information Processing Letters
Computer Methods and Programs in Biomedicine
On the distribution function of the complexity of finite sequences
Information Sciences: an International Journal
The subsequence composition of a string
Theoretical Computer Science
Artificial Intelligence in Medicine
Ziv-Lempel complexity for periodic sequences and its cryptographic application
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Complexity analysis of the biomedical signal using fuzzy entropy measurement
Applied Soft Computing
Quasi-distinct parsing and optimal compression methods
Theoretical Computer Science
A linearly computable measure of string complexity
Theoretical Computer Science
Relevant feature selection from EEG signal for mental task classification
PAKDD'12 Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
A three phase approach for mental task classification using EEG
Proceedings of the International Conference on Advances in Computing, Communications and Informatics
On the detection of unknown locally repeating patterns in images
ICIAR'12 Proceedings of the 9th international conference on Image Analysis and Recognition - Volume Part I
Fast Data Compression with Antidictionaries
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Deterministic Complexity and Entropy
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Time/Space Efficient Compressed Pattern Matching
Fundamenta Informaticae - Computing Patterns in Strings
A comparison of index-based lempel-Ziv LZ77 factorization algorithms
ACM Computing Surveys (CSUR)
Computing regularities in strings: A survey
European Journal of Combinatorics
Speeding up HMM decoding and training by exploiting sequence repetitions
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Fast and practical algorithms for computing all the runs in a string
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Faster variance computation for patterns with gaps
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Research and application of heart sound alignment and descriptor
Computers in Biology and Medicine
An EEG based pervasive depression detection for females
ICPCA/SWS'12 Proceedings of the 2012 international conference on Pervasive Computing and the Networked World
Complexity decompositions in the problem of comparison of polytene chromosome banding sequences
Pattern Recognition and Image Analysis
On compressing and indexing repetitive sequences
Theoretical Computer Science
On parsing optimality for dictionary-based text compression-the Zip case
Journal of Discrete Algorithms
Toward a compression-based self-organizing recognizer: Preliminary implementation of PRDC-CSOR
Pattern Recognition Letters
A method of identifying chronic stress by EEG
Personal and Ubiquitous Computing
Novel multiclass classification for home-based diagnosis of sleep apnea hypopnea syndrome
Expert Systems with Applications: An International Journal
Baseline characteristics of cervical auscultation signals during various head maneuvers
Computers in Biology and Medicine
Multi-user wireless channel probing for shared key generation with a fuzzy controller
Computer Networks: The International Journal of Computer and Telecommunications Networking
Nonlinear dynamics characterization of emotional speech
Neurocomputing
Integrated Computer-Aided Engineering
| Hi-index | 754.84 |
A new approach to the problem of evaluating the complexity ("randomness") of finite sequences is presented. The proposed complexity measure is related to the number of steps in a self-delimiting production process by which a given sequence is presumed to be generated. It is further related to the number of distinct substrings and the rate of their occurrence along the sequence. The derived properties of the proposed measure are discussed and motivated in conjunction with other well-established complexity criteria.