Cargando…
An enhanced beam search algorithm for the Shortest Common Supersequence Problem
The Shortest Common Supersequence Problem asks to obtain a shortest string that is a supersequence of every member of a given set of strings. It has applications, among others, in data compression and oligonucleotide microarray production. The problem is NP-hard, and the existing exact solutions are...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Elsevier Ltd.
2012
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7127599/ https://www.ncbi.nlm.nih.gov/pubmed/32288320 http://dx.doi.org/10.1016/j.engappai.2011.08.006 |