IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v24y2018i3d10.1007_s10732-017-9329-x.html
   My bibliography  Save this article

A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem

Author

Listed:
  • Christian Blum

    (Artificial Intelligence Research Institute (IIIA-CSIC))

  • Maria J. Blesa

    (Technical University of Barcelona – BarcelonaTech)

Abstract

This paper deals with an NP-hard string problem from the bio-informatics field: the repetition-free longest common subsequence problem. This problem has enjoyed an increasing interest in recent years, which has resulted in the application of several pure as well as hybrid metaheuristics. However, the literature lacks a comprehensive comparison between those approaches. Moreover, it has been shown that general purpose integer linear programming solvers are very efficient for solving many of the problem instances that were used so far in the literature. Therefore, in this work we extend the available benchmark set, adding larger instances to which integer linear programming solvers cannot be applied anymore. Moreover, we provide a comprehensive comparison of the approaches found in the literature. Based on the results we propose a hybrid between two of the best methods which turns out to inherit the complementary strengths of both methods.

Suggested Citation

  • Christian Blum & Maria J. Blesa, 2018. "A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem," Journal of Heuristics, Springer, vol. 24(3), pages 551-579, June.
    • Handle: RePEc:spr:joheur:v:24:y:2018:i:3:d:10.1007_s10732-017-9329-x
    DOI: 10.1007/s10732-017-9329-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-017-9329-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10732-017-9329-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joheur:v:24:y:2018:i:3:d:10.1007_s10732-017-9329-x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.