On trace inclusion optimization problems

Authors:
K. V. Shahbazyan;Yu. H. Shoukourian
Affiliations:
Institute for Informatics and Automation Problems, National Academy of Sciences of the Republic of Armenia, Yerevan, Armenia;Institute for Informatics and Automation Problems, National Academy of Sciences of the Republic of Armenia, Yerevan, Armenia
Venue:
Cybernetics and Systems Analysis
Year:
2010

Citing 8
Cited 0

Searching subsequences

Theoretical Computer Science
The shortest common nonsubsequence problem is NP-complete

Theoretical Computer Science
String Noninclusion Optimization Problems

SIAM Journal on Discrete Mathematics
Problems Related to Subsequences and Supersequences

SPIRE '99 Proceedings of the String Processing and Information Retrieval Symposium & International Workshop on Groupware
Directed acyclic subsequence graph: overview

Journal of Discrete Algorithms
Mining Minimal Distinguishing Subsequence Patterns with Gap Constraints

ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Algorithms on Strings

Algorithms on Strings
The longest common subsequence problem a finite automata approach

CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

The following four optimization problems over a finite set of traces are considered: (i) find the longest trace that is included in each trace from a given finite set T of traces, (ii) find the shortest trace that is not included in every trace from a given finite set T of traces, (iii) find the shortest trace that includes every trace from a given finite set T of traces, (iv) find the longest trace that does not include each trace from a given finite set T of traces.