Edit distance of run-length encoded strings

Ora Arbell; Gad M. Landau; Joseph S.B. Mitchell

doi:10.1016/S0020-0190(02)00215-6

Edit distance of run-length encoded strings

Ora Arbell, Gad M. Landau, Joseph S.B. Mitchell

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

An algorithm to calculate the edit distances of run-length encoded strings was presented. Runlength-encoding was described as a popular image compression technique used in facsimile transmission or for optical character recognition. The definitions of edit distances, longest common sequences (LCS), run-length encoded strings were also presented.

Original language	English
Pages (from-to)	307-314
Number of pages	8
Journal	Information Processing Letters
Volume	83
Issue number	6
DOIs	https://doi.org/10.1016/S0020-0190(02)00215-6
State	Published - 30 Sep 2002

Bibliographical note

Funding Information:
2Partially supported by grants from the Binational Science Foundation, HRL Laboratories, the National Science Foundation (CCR-9732221, CCR-0098172), NASA Ames Research Center, Northrop-Grumman Corporation, Sandia National Labs, Seagull Technology, and Sun Microsystems.

Funding Information:
1 Partially supported by by the Israel Science Foundation grants 173/98 and 282/01.

Funding Information:
* Corresponding author. Partially supported by NSF grants CCR-9610238 and CCR-0104307, by NATO Science Programme grant PST.CLG.977017, by the Israel Science Foundation grants 173/98 and 282/01, by the FIRST Foundation of the Israel Academy of Science and Humanities, and by IBM Faculty Partnership Award. E-mail addresses: [email protected] (O. Arbell), [email protected] (G.M. Landau), [email protected] (J.S.B. Mitchell).

Keywords

Algorithms
Dynamic programming
Edit distance
Run-length compression
String matching

ASJC Scopus subject areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/S0020-0190(02)00215-6

Cite this

@article{09c441768e0141eca3f33fa0a7bcccd1,

title = "Edit distance of run-length encoded strings",

abstract = "An algorithm to calculate the edit distances of run-length encoded strings was presented. Runlength-encoding was described as a popular image compression technique used in facsimile transmission or for optical character recognition. The definitions of edit distances, longest common sequences (LCS), run-length encoded strings were also presented.",

keywords = "Algorithms, Dynamic programming, Edit distance, Run-length compression, String matching",

author = "Ora Arbell and Landau, {Gad M.} and Mitchell, {Joseph S.B.}",

note = "Funding Information: 2Partially supported by grants from the Binational Science Foundation, HRL Laboratories, the National Science Foundation (CCR-9732221, CCR-0098172), NASA Ames Research Center, Northrop-Grumman Corporation, Sandia National Labs, Seagull Technology, and Sun Microsystems. Funding Information: 1 Partially supported by by the Israel Science Foundation grants 173/98 and 282/01. Funding Information: * Corresponding author. Partially supported by NSF grants CCR-9610238 and CCR-0104307, by NATO Science Programme grant PST.CLG.977017, by the Israel Science Foundation grants 173/98 and 282/01, by the FIRST Foundation of the Israel Academy of Science and Humanities, and by IBM Faculty Partnership Award. E-mail addresses: [email protected] (O. Arbell), [email protected] (G.M. Landau), [email protected] (J.S.B. Mitchell).",

year = "2002",

month = sep,

day = "30",

doi = "10.1016/S0020-0190(02)00215-6",

language = "English",

volume = "83",

pages = "307--314",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "6",

}

TY - JOUR

T1 - Edit distance of run-length encoded strings

AU - Arbell, Ora

AU - Landau, Gad M.

AU - Mitchell, Joseph S.B.

N1 - Funding Information: 2Partially supported by grants from the Binational Science Foundation, HRL Laboratories, the National Science Foundation (CCR-9732221, CCR-0098172), NASA Ames Research Center, Northrop-Grumman Corporation, Sandia National Labs, Seagull Technology, and Sun Microsystems. Funding Information: 1 Partially supported by by the Israel Science Foundation grants 173/98 and 282/01. Funding Information: * Corresponding author. Partially supported by NSF grants CCR-9610238 and CCR-0104307, by NATO Science Programme grant PST.CLG.977017, by the Israel Science Foundation grants 173/98 and 282/01, by the FIRST Foundation of the Israel Academy of Science and Humanities, and by IBM Faculty Partnership Award. E-mail addresses: [email protected] (O. Arbell), [email protected] (G.M. Landau), [email protected] (J.S.B. Mitchell).

PY - 2002/9/30

Y1 - 2002/9/30

N2 - An algorithm to calculate the edit distances of run-length encoded strings was presented. Runlength-encoding was described as a popular image compression technique used in facsimile transmission or for optical character recognition. The definitions of edit distances, longest common sequences (LCS), run-length encoded strings were also presented.

AB - An algorithm to calculate the edit distances of run-length encoded strings was presented. Runlength-encoding was described as a popular image compression technique used in facsimile transmission or for optical character recognition. The definitions of edit distances, longest common sequences (LCS), run-length encoded strings were also presented.

KW - Algorithms

KW - Dynamic programming

KW - Edit distance

KW - Run-length compression

KW - String matching

UR - http://www.scopus.com/inward/record.url?scp=0037200863&partnerID=8YFLogxK

U2 - 10.1016/S0020-0190(02)00215-6

DO - 10.1016/S0020-0190(02)00215-6

M3 - Article

AN - SCOPUS:0037200863

SN - 0020-0190

VL - 83

SP - 307

EP - 314

JO - Information Processing Letters

JF - Information Processing Letters

IS - 6

ER -

Edit distance of run-length encoded strings

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this