A comprehensive survey of a rapidly expanding field of combinatorial optimization,
mathematically oriented but offering biological explanations when required. From one cell to …

In comparative genomics, a transposition is an operation that exchanges two consecutive
sequences of genes in a genome. The transposition distance between two genomes, that is …

This paper describes a general hybrid metaheuristic for combinatorial optimization labelled
Construct, Merge, Solve & Adapt. The proposed algorithm is a specific instantiation of a …

A central problem in comparative genomics consists in computing a open parenthesis dis
hyphen closing parenthesis similarity measure between two genomes comma e period g …

The rearrangement distance is a method to compare genomes of different species. Such
distance is the number of rearrangement events necessary to transform one genome into …

Abstract The NP-hard Minimum Common String Partition problem asks whether two strings x
and y can each be partitioned into at most k substrings such that both partitions use exactly …

Recent works on genome rearrangements have shown that incorporating intergenic region
information along with gene order in models provides better estimations for the …

Abstract Minimum Common String Partition (MCSP) has drawn much attention due to its
application in genome rearrangement. In this paper, we investigate three variants of MCSP …

Motivated by the study of genome rearrangements, the NP-hard Minimum Common String
Partition problems asks, given two strings, to split both strings into an identical set of blocks …

Abstract Minimum Common String Partition (MCSP) and related problems are of interest in,
eg, comparative genomics, DNA fingerprint assembly, and ortholog assignment. Given two …