Graph search and variable neighborhood search for finding constrained longest common subsequences in artificial and real gene sequences - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Marko Djukanovic, Aleksandar Kartelj, Dragan Matic, Milana Grbic, Christian Blum 0001, Günther R. Raidl. Graph search and variable neighborhood search for finding constrained longest common subsequences in artificial and real gene sequences. Appl. Soft Comput., 122:108844, 2022. [doi]

The following publications are possibly variants of this publication:

Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithmsSandro Pirkwieser, Günther R. Raidl. gecco 2008: 323-330 [doi]

⁎ search algorithm for the constrained longest common subsequence problemMarko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum 0001. ipl, 166:106041, 2021. [doi]

runs on WebDSL