A multiobjective optimization algorithm for the weighted LCS
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2163025 (Why is no real title available?)
- A fast algorithm for computing longest common subsequences
- Algorithms in computational molecular biology. Techniques approaches and applications.
- Algorithms on Strings, Trees and Sequences
- An algorithmic framework for motif discovery problems in weighted sequences
- Approximate Matching in Weighted Sequences
- LCS Approximation via Embedding into Local Non-repetitive Strings
- Matching for run-length encoded strings
- New algorithms for the LCS problem
- On the common substring alignment problem
- On the generalized constrained longest common subsequence problems
- Polynomial-time approximation algorithms for weighted LCS problem
- The Complexity of Some Problems on Subsequences and Supersequences
- The constrained longest common subsequence problem
- The weighted suffix tree: an efficient data structure for handling molecular weighted sequences and its applications
- Two algorithms for LCS consecutive suffix alignment
- Weighted LCS
Cited in
(2)
This page was built for publication: A multiobjective optimization algorithm for the weighted LCS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q313763)