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.

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.

BibTeX

@inproceedings{Lopez-RodriguezM09,
     author = {Domingo López{-}Rodríguez and
     Enrique Mérida Casermeiro},
     editor = {Mikko Kolehmainen and
     Pekka J. Toivanen and
     Bartlomiej Beliczynski},
     title = {Shortest Common Superstring Problem with Discrete Neural Networks},
     booktitle = {Adaptive and Natural Computing Algorithms, 9th International Conference,
     {ICANNGA} 2009, Kuopio, Finland, April 23-25, 2009, Revised Selected
     Papers},
     series = {Lecture Notes in Computer Science},
     volume = {5495},
     pages = {62–71},
     publisher = {Springer},
     year = {2009},
     url = {https://doi.org/10.1007/978-3-642-04921-7_7},
     doi = {10.1007/978-3-642-04921-7_7},
     timestamp = {Tue, 14 May 2019 10:00:51 +0200},
     biburl = {https://dblp.org/rec/conf/icannga/Lopez-RodriguezM09.bib},
     bibsource = {dblp computer science bibliography, https://dblp.org}
}

Bibliometric data

The following data has been extracted from resources such as OpenAlex, Dimensions, PlumX or Altmetric.

2

CITATIONS

2 Total citations

0 Recent citations

0.45 Field Citation Ratio

n/a Relative Citation Ratio

• Citations
• CrossRef - Citation Indexes: 1
• Scopus - Citation Indexes: 4

• Captures
• Mendeley - Readers: 2

-

see details

Cites

The following graph plots the number of cites received by this work from its publication, on a yearly basis.

Papers citing this work

The following is a non-exhaustive list of papers that cite this work:

[1] T. P. Gevezes and L. S. Pitsoulis. “The Shortest Superstring Problem”. In: Optimization in Science and Engineering. Springer New York, 2014, p. 189–227. ISBN: 9781493908080. DOI: 10.1007/978-1-4939-0808-0_10. URL: http://dx.doi.org/10.1007/978-1-4939-0808-0_10.

[2] T. Gevezes and L. Pitsoulis. “A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem”. In: Journal of Combinatorial Optimization 29.4 (May. 2013), p. 859–883. ISSN: 1573-2886. DOI: 10.1007/s10878-013-9622-z. URL: http://dx.doi.org/10.1007/s10878-013-9622-z.