ARP: A Configurable Heuristic for the MLCS Problem

Read full text Summarise with VIRAT
Authors: Farhana Akter Tumpa, Rebin Silva Valan Arasu, Rajiv Gupta
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

This repository provides the official implementation of ARP, an efficient heuristic algorithm for the Multiple Longest Common Subsequence (MLCS) problem.ARP introduces selection-based search that constructs high-quality MLCS solutions through three key components: Addition-Δs — incrementally adding subsequences from a chosen primary string Replacement — replacing subsequences across candidate solutions to increase diversity Prioritization — ranking character groups to guide the Δ-addition orderARP provides configurable trade-offs between runtime and solution quality and consistently produces strong MLCS results across multiple benchmark datasets.

Fields of Study & Subjects

Algorithms and Data Compression Genomics and Phylogenetic Studies Metaheuristic Optimization Algorithms Research

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
22 March 2026
Language
EN