Christian Blum, Carlos Cotta, Antonio J. Fernández, José E. Gallardo. A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem. In Carlos Cotta, Jano I. van Hemert, editors, Evolutionary Computation in Combinatorial Optimization, 7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007, Proceedings. Volume 4446 of Lecture Notes in Computer Science, pages 36-47, Springer, 2007. [doi]
@inproceedings{BlumCFG07,
title = {A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem},
author = {Christian Blum and Carlos Cotta and Antonio J. Fernández and José E. Gallardo},
year = {2007},
doi = {10.1007/978-3-540-71615-0_4},
url = {http://dx.doi.org/10.1007/978-3-540-71615-0_4},
tags = {e-science, search, systematic-approach},
researchr = {https://researchr.org/publication/BlumCFG07},
cites = {0},
citedby = {0},
pages = {36-47},
booktitle = {Evolutionary Computation in Combinatorial Optimization, 7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007, Proceedings},
editor = {Carlos Cotta and Jano I. van Hemert},
volume = {4446},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-71614-3},
}