A multiobjective optimization algorithm for the weighted LCS
From MaRDI portal
Publication:313763
DOI10.1016/J.DAM.2015.11.005zbMATH Open1350.68300OpenAlexW2203109677MaRDI QIDQ313763FDOQ313763
Authors: David Becerra, Juan Mendivelso, Yoan Pinzón
Publication date: 12 September 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.005
Recommendations
Cites Work
- Algorithms on Strings, Trees and Sequences
- Polynomial-time approximation algorithms for weighted LCS problem
- An algorithmic framework for motif discovery problems in weighted sequences
- Approximate Matching in Weighted Sequences
- The weighted suffix tree: an efficient data structure for handling molecular weighted sequences and its applications
- Weighted LCS
- The constrained longest common subsequence problem
- Matching for run-length encoded strings
- On the common substring alignment problem
- A fast algorithm for computing longest common subsequences
- On the generalized constrained longest common subsequence problems
- New algorithms for the LCS problem
- Two algorithms for LCS consecutive suffix alignment
- Algorithms in computational molecular biology. Techniques approaches and applications.
- LCS Approximation via Embedding into Local Non-repetitive Strings
- The Complexity of Some Problems on Subsequences and Supersequences
- Title not available (Why is that?)
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)