Journal ArticleDOI
Edit distance for a run-length-encoded string and an uncompressed string
Reads0
Chats0
TLDR
A new algorithm for computing the edit distance of an uncompressed string against a run-length-encoded string and its result directly implies an O(min{mN,Mn}) time algorithm for strings of lengths m and n with M and N runs, respectively.About:
This article is published in Information Processing Letters.The article was published on 2008-01-01. It has received 17 citations till now. The article focuses on the topics: Rabin–Karp algorithm & Edit distance.read more
Citations
More filters
Journal ArticleDOI
Binary image encryption in a joint transform correlator scheme by aid of run-length encoding and QR code
TL;DR: The proposed method successfully, for the first time to the best knowledge, encodes a binary image into a QR code with the identical size of it, and therefore may probe a new way for extending the application of QR code in optical security.
Journal ArticleDOI
A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings
TL;DR: A simple algorithm for computing the longest common subsequence of two given strings X and Y in O(kl+min{p"1,p"2}) time, where p"1 and p"2 denote the numbers of elements in the bottom and right boundaries of the matched blocks, respectively.
Journal ArticleDOI
Hardness of comparing two run-length encoded strings
TL;DR: The 3sum-hardness is proved for both the wildcard matching problem and the k-mismatch problem with run-length compressed inputs, which implies that it is very unlikely to devise an o(mn)-time algorithm for either of them.
Book ChapterDOI
Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard
TL;DR: It is shown that the wildcard matching and k -mismatches problems for rle strings are 3sum -hard, which implies that it is very unlikely to devise an o (mn )-time algorithm for either problem.
Book ChapterDOI
Sequence Alignment Algorithms for Run-Length-Encoded Strings
TL;DR: A unified framework is applied to solving various sequence comparison problems for run-length encoded strings by assuming the linear-gap model and making no assumption on the scoring matrices, which maximizes the applicability of these algorithms.
References
More filters
Journal Article
Binary codes capable of correcting deletions, insertions, and reversals
Book
Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology
TL;DR: In this paper, the authors introduce suffix trees and their use in sequence alignment, core string edits, alignments and dynamic programming, and extend the core problems to extend the main problems.
Book
Introduction to data compression
TL;DR: The author explains the development of the Huffman Coding Algorithm and some of the techniques used in its implementation, as well as some of its applications, including Image Compression, which is based on the JBIG standard.
Algorithms on strings, trees, and sequences
TL;DR: Ukkonen’s method is the method of choice for most problems requiring the construction of a suffix tree, and it will be presented first because it is easier to understand.
Related Papers (5)
An improved algorithm for computing the edit distance of run-length coded strings
Horst Bunke,János Csirik +1 more