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...

Descripción completa

Detalles Bibliográficos
Autores principales: Mousavi, Sayyed Rasoul, Bahri, Fateme, Tabataba, Farzaneh Sadat
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Elsevier Ltd. 2012
Materias:
Article
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

Internet

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

Ejemplares similares