Weighted shortest common supersequence problem revisited

DOI10.1007/978-3-030-32686-9_16zbMATH Open1539.68376MaRDI QIDQ6536257

Tomasz Waleń, T. Kociumaka, Juliusz Straszyński, Solon P. Pissis, W. Rytter, J. Radoszewski, Panagiotis Charalampopoulos, Wiktor Zuba

Publication date: 19 April 2024

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Algorithms on strings (68W32)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Polynomial-time approximation algorithms for weighted LCS problem
• Linear-time computation of prefix table for weighted strings {\&} applications
• Property matching and weighted matching
• The shortest common supersequence problem over binary alphabet is NP- complete
• Which problems have strongly exponential complexity?
• Crochemore's partitioning on weighted strings and applications
• On-line weighted pattern matching
• Pattern matching and consensus problems on weighted sequences and profiles
• Indexing weighted sequences: neat and efficient
• Property suffix array with applications
• Computing Partitions with Applications to the Knapsack Problem
• The Complexity of Some Problems on Subsequences and Supersequences
• Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems
• On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
• Reducibility among Combinatorial Problems
• Weighted LCS
• On the complexity of \(k\)-SAT
• Weighted shortest common supersequence

This page was built for publication: Weighted shortest common supersequence problem revisited

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