A multiobjective optimization algorithm for the weighted LCS

DOI10.1016/J.DAM.2015.11.005zbMath1350.68300OpenAlexW2203109677MaRDI QIDQ313763

Juan Mendivelso, David Becerra, Yoan J. Pinzon

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

zbMATH Keywords

multiobjective optimizationlongest common subsequence (LCS)weighted LCSweighted sequences

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Unnamed Item
• On the generalized constrained longest common subsequence problems
• The constrained longest common subsequence problem
• New algorithms for the LCS problem
• Matching for run-length encoded strings
• Two algorithms for LCS consecutive suffix alignment
• On the Common Substring Alignment Problem
• Polynomial-Time Approximation Algorithms for Weighted LCS Problem
• Algorithms in Computational Molecular Biology
• An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences
• LCS Approximation via Embedding into Local Non-repetitive Strings
• A fast algorithm for computing longest common subsequences
• The Complexity of Some Problems on Subsequences and Supersequences
• Algorithms on Strings, Trees and Sequences
• Approximate Matching in Weighted Sequences
• Weighted LCS

This page was built for publication: A multiobjective optimization algorithm for the weighted LCS