Combinatorial Methods for String Processing

Strings, or sequences, are the most fundamental form of digital data. Due to recent developments in sensor network technologies and semi-automated machine-to-machine (M2M) communications, sequential data have been increasing more rapidly than ever. It is often the case that such semi-automatically generated sequential data contain abundant repetitive structures. Thus, understanding, revealing, and utilizing combinatorial objects that reside in strings are of great significance in designing efficient string processing algorithms and data structures. Typical topics of interests include (but are not limited to):- Combinatorial string problems and solutions;- Pattern matching algorithms;- Applied combinatorics on words;- Text compression;- Data structures for strings, labeled trees, and compressed text.This Special Issue contains five peer-reviewed papers.