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

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

ISSN: 1611-3349,  0302-9743

ISBN: 9783319116822

Argitalpen urtea: 2014

Alea: 8752

Orrialdeak: 79-90

Mota: Biltzar ekarpena

DOI: 10.1007/978-3-319-11683-9_7 GOOGLE SCHOLAR
Datuen iturria: Scopus