Shortest Common Superstring Problem with Discrete Neural Networks
Abstract
In this paper, we investigate the use of artificial neural networks in order to solve the Shortest Common Superstring Problem. Concretely, the neural network used in this work is based on a multivalued model, MREM, very suitable for solving combinatorial optimization problems. We describe the foundations of this neural model, and how it can be implemented in the context of this problem, by taking advantage of a better representation than in other models, which, in turn, contributes to ease the computational dynamics of the model. Experimental results prove that our model outperforms other heuristic approaches known from the specialized literature.
Cites
The following graph plots the number of cites received by this work from its publication, on a yearly basis.
Citation
Please, cite this work as:
[LC09] D. López-Rodríguez and E. M. Casermeiro. “Shortest Common Superstring Problem with Discrete Neural Networks”. In: Adaptive and Natural Computing Algorithms, 9th International Conference, ICANNGA 2009, Kuopio, Finland, April 23-25, 2009, Revised Selected Papers. Ed. by M. Kolehmainen, P. J. Toivanen and B. Beliczynski. Vol. 5495. Lecture Notes in Computer Science. Springer, 2009, pp. 62-71. DOI: 10.1007/978-3-642-04921-7_7. URL: https://doi.org/10.1007/978-3-642-04921-7_7.