Polynomial-time approximation algorithms for weighted LCS problem
DOI10.1016/J.DAM.2015.11.011zbMATH Open1335.68304OpenAlexW2211499725MaRDI QIDQ266804FDOQ266804
Authors: Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń 
Publication date: 7 April 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.11.011
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Algorithms on strings (68W32)
Cites Work
- Title not available (Why is that?)
- Algorithms on Strings, Trees and Sequences
- Polynomial-time approximation algorithms for weighted LCS problem
- An algorithmic framework for motif discovery problems in weighted sequences
- Varieties of Regularities in Weighted Sequences
- Approximate Matching in Weighted Sequences
- String Processing and Information Retrieval
- Computing the repetitions in a biological weighted sequence
- The weighted suffix tree: an efficient data structure for handling molecular weighted sequences and its applications
- Computational and Information Science
- Weighted LCS
- Property matching and weighted matching
Cited In (8)
- Polynomial-time approximation algorithms for weighted LCS problem
- On-line weighted pattern matching
- Weighted LCS (extended abstract)
- Weighted LCS
- Title not available (Why is that?)
- Approximating LCS in Linear Time: Beating the √n Barrier
- Weighted shortest common supersequence problem revisited
- Crochemore's partitioning on weighted strings and applications
Uses Software
This page was built for publication: Polynomial-time approximation algorithms for weighted LCS problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q266804)
