✦ LIBER ✦

Edit distance of run-length encoded strings

✍ Scribed by Ora Arbell; Gad M. Landau; Joseph S.B. Mitchell

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 745 KB
Volume: 83
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(02)00215-6

No coin nor oath required. For personal study only.

✦ Synopsis

Let X and Y be two run-length encoded strings, of encoded lengths k and l, respectively. We present a simple O(|X|l + |Y |k) time algorithm that computes their edit distance.

📜 SIMILAR VOLUMES

Matching for Run-Length Encoded Strings

✍ Alberto Apostolico; Gad M Landau; Steven Skiena 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 300 KB

An improved algorithm for computing the

An improved algorithm for computing the edit distance of run-length coded strings

✍ H. Bunke; J. Csirik 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 379 KB

Classification of run-length encoded bin

Classification of run-length encoded binary data

✍ T. Ravindra Babu; M. Narasimha Murty; V.K. Agrawal 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 152 KB

In classification of binary featured data, distance computation is carried out by considering each feature. We represent the given binary data as run-length encoded data. This would lead to a compact or compressed representation of data. Further, we propose an algorithm to directly compute the Manha

Template-based rendering of run-length-

Template-based rendering of run-length- encoded volumes

✍ Lee, Cheol-Hi ;Koo, Yun-Mo ;Shin, Yeong Gil 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 206 KB

Template-based volume rendering is a technique to accelerate volume ray casting. It does not trade off image quality for rendering speed. However, it still falls short of interactive manipulation of volume data, mainly owing to the ray-by-ray volume access pattern and the long ray path in the transp

A posteriori scaling of run length encod

A posteriori scaling of run length encoded polygons

✍ Ph. Coueignoux 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 254 KB

Scaling run-length encoded binary patterns is quite useful in some instances of computer graphics, such as phototypesetting with variable-sized characters. A very simple method can be used to perform the scaling, which separates scaling along the direction of the runs and along the perpendicular. Th

An effective algorithm for string correc

An effective algorithm for string correction using generalized edit distance—II. Computational complexity of the algorithm and some applications

✍ R.L. Kashyap; B.J. Oommen 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 981 KB