Output details
11 - Computer Science and Informatics
University of Ulster
Return to search
Output 0 of 0 in the submission
Article title
Algorithms for Subsequence Combinatorics
Type
D - Journal article
Title of journal
Theoretical Computer Science
Article number
-
Volume number
409
Issue number
3
First page of article
394
ISSN of journal
0304-3975
Year of publication
2008
URL
-
Number of additional authors
2
Additional information
<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.
Interdisciplinary
-
Cross-referral requested
-
Research group
A - Artificial Intelligence and Applications
Citation count
15
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
