Solving the minimum common string partition problem with the help of ants

DOI10.1007/S11786-017-0293-5zbMath1409.68270arXiv1401.4539OpenAlexW2951142314MaRDI QIDQ2363999

M. Sohel Rahman, S. M. Ferdous

Publication date: 17 July 2017

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.4539

zbMATH Keywords

metaheuristicsgraph algorithmscomputational biologyant colony optimization

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Algorithms on strings (68W32)

Related Items (4)

On the role of metaheuristic optimization in bioinformatics ⋮ Minimum common string partition: on solving large‐scale problem instances ⋮ ILP-based reduced variable neighborhood search for large-scale minimum common string partition ⋮ Computational performance evaluation of two integer linear programming models for the minimum common string partition problem

Uses Software

• FaBox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding the longest common subsequence for multiple biological sequences by ant colony optimization
• An ant colony optimization algorithm for DNA sequencing by hybridization
• Minimum common string partition problem: hardness and approximations
• Mathematical programming strategies for solving the minimum common string partition problem
• The greedy algorithm for the minimum common string partition problem
• Minimum Common String Partition Revisited

This page was built for publication: Solving the minimum common string partition problem with the help of ants