On trace inclusion optimization problems
From MaRDI portal
Publication:2247802
DOI10.1007/s10559-010-9268-0zbMath1291.68439OpenAlexW1971270045MaRDI QIDQ2247802
Yu. H. Shoukourian, K. V. Shahbazyan
Publication date: 30 June 2014
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-010-9268-0
Cites Work
- Unnamed Item
- The shortest common nonsubsequence problem is NP-complete
- Directed acyclic subsequence graph -- overview
- Inclusion problems in trace monoids
- Searching subsequences
- String Noninclusion Optimization Problems
- Jewels of Stringology
- Algorithms on Strings
- Window-accumulated subsequence matching problem is linear