On Solving a Generalized Constrained Longest Common Subsequence Problem
Given a set of two input strings and a pattern string, the constrained longest common subsequence problem deals with finding a longest string that is a subsequence of both input strings and that contains the given pattern string as a subsequence. This problem has various applications, especially in...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | otro |
| Estado: | Versión aceptada para publicación |
| Fecha de publicación: | 2020 |
| País: | España |
| Institución: | Consejo Superior de Investigaciones Científicas (CSIC) |
| Repositorio: | DIGITAL.CSIC. Repositorio Institucional del CSIC |
| OAI Identifier: | oai:digital.csic.es:10261/235422 |
| Acceso en línea: | http://hdl.handle.net/10261/235422 https://doi.org/10.1007/978-3-030-62867-3_5 |
| Access Level: | acceso abierto |
| Palabra clave: | Longest common subsequences Constrained subsequences Beam search A∗ search |
| Sumario: | Given a set of two input strings and a pattern string, the constrained longest common subsequence problem deals with finding a longest string that is a subsequence of both input strings and that contains the given pattern string as a subsequence. This problem has various applications, especially in computational biology. In this work we consider the NP –hard case of the problem in which more than two input strings are given. First, we adapt an existing A ∗ search from two input strings to an arbitrary number m of input strings ( m≥2 ). With the aim of tackling large problem instances approximately, we additionally propose a greedy heuristic and a beam search. All three algorithms are compared to an existing approximation algorithm from the literature. Beam search turns out to be the best heuristic approach, matching almost all optimal solutions obtained by A ∗ search for rather small instances. |
|---|