135 citations · 160 across the 16 of their papers we have counts for
4 papers · 1 filter
Extending Common Intervals Searching from Permutations to Sequences
Irena Rusu
Common intervals have been defined as a modelisation of gene clusters in genomes represented either as permutations or as sequences. Whereas optimal algorithms for finding common i…
A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications
Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz +1
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…
Easy identification of generalized common and conserved nested intervals
Fabien de Montgolfier, Mathieu Raffinot, Irena Rusu
In this paper we explain how to easily compute gene clusters, formalized by classical or generalized nested common or conserved intervals, between a set of K genomes represented as…
MinMax-Profiles: A Unifying View of Common Intervals, Nested Common Intervals and Conserved Intervals of K Permutations
Irena Rusu
Common intervals of K permutations over the same set of n elements were firstly investigated by T. Uno and M.Yagiura (Algorithmica, 26:290:309, 2000), who proposed an efficient alg…