In the last decade there has been an ongoing interest in string comparison problems; to a
large extend the interest was stimulated by genome rearrangement problems in …

This paper proposes a model for measuring similarity between videos which content is
Chinese Sign Language (CSL), vision and sign language semantic are considered for the …

LoRa has become one of the most promising networking technologies for Internet-of-Things
applications. Distant end devices have to use a low data rate to reach a LoRa gateway …

For a string A= a1… an, a reversalρ (i, j), 1⩽ i⩽ j⩽ n, transforms the string A into a string A′=
a1… ai-1ajaj-1… aiaj+ 1… an, that is, the reversal ρ (i, j) reverses the order of symbols in the …

In this paper, we focus on the edit distance between two given strings where block-edit
operations are allowed and better fitting to the human natural edit behaviors. Previous …

In this paper, we consider the problem of finding a minimum common partition of two strings.
The problem has its application in Genome Comparison. As it is an NP-hard, discrete …

Computing genomic distances between whole genomes is a fundamental problem in
comparative genomics. Recent researches have resulted in different genomic distance …

In this paper we investigate the parameterized complexity of the Maximum-Duo Preservation
String Mapping Problem, the complementary of the Minimum Common String Partition …

Though many compression methods are based on the use of variable length codes, there
has recently been a trend to search for alternatives in which the lengths of the codewords …

Though many compression methods are based on the use of variable length codes, there
has recently been a trend to search for alternatives in which the lengths of the codewords …