On trace inclusion optimization problems

DOI10.1007/S10559-010-9268-0zbMATH Open1291.68439OpenAlexW1971270045MaRDI QIDQ2247802FDOQ2247802

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

zbMATH Keywords

optimizationinclusion problemstring processingtrace theory

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites Work

• Jewels of Stringology
• Algorithms on Strings
• Directed acyclic subsequence graph -- overview
• Searching subsequences
• Inclusion problems in trace monoids
• Window-accumulated subsequence matching problem is linear
• The shortest common nonsubsequence problem is NP-complete
• String Noninclusion Optimization Problems
• Title not available (Why is that?)

   Recommendations

• Inclusion problems in trace monoids 👍 👎
• Title not available (Why is that?) 👍 👎
• String Noninclusion Optimization Problems 👍 👎
• Title not available (Why is that?) 👍 👎
• Forbidden traces and forbidden subtraces 👍 👎

This page was built for publication: On trace inclusion optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2247802)