[CPM-SPIRE-L] 2nd CFP: Special Issue on Combinatorial Methods for String Processing

[Shunsuke Inenaga]

Journal: Algorithms
Special Issue: Combinatorial Methods for String Processing
Submission Deadline: *1 December, 2020* (updated)

Dear Colleagues,

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. This Special Issue on “Combinatorial Methods for
String Processing” aims exactly at this goal.

We cordially invite you to submit high-quality papers to this Special
Issue. 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

More details for the special issue can be found at:
https://www.mdpi.com/journal/algorithms/special_issues/String_Processing

Guest Editor
Shunsuke Inenaga
Associate Professor, Department of Informatics, Kyushu University
https://str.i.kyushu-u.ac.jp/~inenaga/