String Noninclusion Optimization Problems
From MaRDI portal
Publication:4210217
DOI10.1137/S0895480192234277zbMath0907.68090OpenAlexW1998365421MaRDI QIDQ4210217
A. R. Rubinov, Timkovsky, Vadim G.
Publication date: 21 September 1998
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480192234277
commonpolynomial-time algorithmsuperstringNP-hard problemsubsequencesubstringsupersequencestring inclusionlongestshortest
Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)
Related Items (max. 100)
A new graph model and algorithms for consistent superstring problems ⋮ Consistent subsequences and supersequences ⋮ On the approximation of longest common nonsupersequences and shortest common nonsubsequences ⋮ Shortest consistent superstrings computable in polynomial time ⋮ Restricted Common Superstring and Restricted Common Supersequence ⋮ On trace inclusion optimization problems ⋮ Finding the longest common nonsuperstring in linear time
This page was built for publication: String Noninclusion Optimization Problems