On trace inclusion optimization problems

DOI10.1007/S10559-010-9268-0MaRDI QIDQ2247802zbMATHOpenAlexFDO

Authors K. V. Shahbazyan, Yu. H. Shoukourian

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)

Recommendations

• Inclusion problems in trace monoids
• scientific article; zbMATH DE number 5953970
• String Noninclusion Optimization Problems
• scientific article; zbMATH DE number 3974159
• Forbidden traces and forbidden subtraces

Cites work

• scientific article; zbMATH DE number 5953970 (Why is no real title available?)
• Algorithms on Strings
• Directed acyclic subsequence graph -- overview
• Inclusion problems in trace monoids
• Jewels of Stringology
• Searching subsequences
• String Noninclusion Optimization Problems
• The shortest common nonsubsequence problem is NP-complete
• Window-accumulated subsequence matching problem is linear

Cited in

(1)

• Inclusion problems in trace monoids

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)