A representation scheme for finite length strings
MetadataShow full item record
This study is an attempt to create a canonical representation scheme for finite length strings to simplify the study of the theory behind different classes of patterns and to ease the understanding of the underlying separability issues. This could then be used to determine what kinds of techniques are suitable for what class of separability (linear, multi-linear, or non-linear). This representation can then be used in intrusion detection, biological sequences, pattern recognition/classification and numerous other applications.