Reversal distance for strings with duplicates: Linear time approximation using hitting set
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 …
large extend the interest was stimulated by genome rearrangement problems in …
Similarity assessment model for Chinese sign language videos
LC Wang, R Wang, DH Kong… - IEEE Transactions on …, 2014 - ieeexplore.ieee.org
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 …
Chinese Sign Language (CSL), vision and sign language semantic are considered for the …
Towards energy-fairness in LoRa networks
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 …
applications. Distant end devices have to use a low data rate to reach a LoRa gateway …
[HTML][HTML] Approximating reversal distance for strings with bounded number of duplicates
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 …
a1… ai-1ajaj-1… aiaj+ 1… an, that is, the reversal ρ (i, j) reverses the order of symbols in the …
Efficient algorithms for the block edit problems
HY Ann, CB Yang, YH Peng, BC Liaw - Information and Computation, 2010 - Elsevier
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 …
operations are allowed and better fitting to the human natural edit behaviors. Previous …
Solving the minimum common string partition problem with the help of ants
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 …
The problem has its application in Genome Comparison. As it is an NP-hard, discrete …
A pseudo-boolean framework for computing rearrangement distances between genomes with duplicates
S Angibaud, G Fertin, I Rusu… - Journal of Computational …, 2007 - liebertpub.com
Computing genomic distances between whole genomes is a fundamental problem in
comparative genomics. Recent researches have resulted in different genomic distance …
comparative genomics. Recent researches have resulted in different genomic distance …
[HTML][HTML] Parameterized tractability of the maximum-duo preservation string map** problem
In this paper we investigate the parameterized complexity of the Maximum-Duo Preservation
String Map** Problem, the complementary of the Minimum Common String Partition …
String Map** Problem, the complementary of the Minimum Common String Partition …
Improved variable-to-fixed length codes
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 …
has recently been a trend to search for alternatives in which the lengths of the codewords …
On improving Tunstall codes
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 …
has recently been a trend to search for alternatives in which the lengths of the codewords …