Beam-ACO for the repetition-free longest common subsequence problem

  1. Blum, C.
  2. Blesa, M.J.
  3. Calvo, B.
Book Series:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ISSN: 1611-3349,  0302-9743

ISBN: 9783319116822

Year of publication: 2014

Volume: 8752

Pages: 79-90

Type: Conference paper

DOI: 10.1007/978-3-319-11683-9_7 GOOGLE SCHOLAR
Data source: Scopus