Output details
11 - Computer Science and Informatics
University of Ulster
Algorithms for Subsequence Combinatorics
<13>Counting sub-sequences under constraints has become relevant to biological sequence analysis, machine learning, coding theory, categorical time series analysis in social sciences, and the theory of word complexity. This paper extends earlier work by Wang on ACS and by Elzinga on efficient sequence counting, resulting in the GRID and TRAIL algorithms that count common sub-sequences in various cases. This work has led to established collaboration with Elzinga and Rahmann, 5 subsequent journal papers, and has contributed to two PhD projects (Zhiwei Lin and Luis Trindade) and the DEEPFLOW project, funded by SAP and InvestNI, on argumentation structure extraction from text.