Journal article · 1996

Universal Data Compression Algorithm Based on Approximate String Matching

Ilan Sadeh

Probability in the Engineering and Informational Sciences, 10(4), 465–486 · Published 1 October 1996 · DOI 10.1017/s0269964800004502

View at the publisherCite this paper

In brief

“Universal Data Compression Algorithm Based on Approximate String Matching” is a 1996 journal article by Ilan Sadeh, published in Probability in the Engineering and Informational Sciences. OpenAlex counts 11 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
11
Most cited in
2012 (1)
Field-weighted impact
1.12
References
36
Authors
1

Abstract

A practical source coding scheme based on approximate string matching is proposed. It is an approximate fixed-length string matching data compression combined with a block-coder based on the empirical distribution. A lemma on approximate string matching, which is an extension of the Kac Lemma, is proved. It is shown, based on the lemma, that the… Read the full abstract at the publisher.

Excerpt. This paper is not open access.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Sadeh, I. (1996). Universal Data Compression Algorithm Based on Approximate String Matching. Probability in the Engineering and Informational Sciences, 10(4), 465–486. https://doi.org/10.1017/s0269964800004502

MLA 9

Sadeh, Ilan. “Universal Data Compression Algorithm Based on Approximate String Matching.” Probability in the Engineering and Informational Sciences, vol. 10, no. 4, 1996, pp. 465–486. https://doi.org/10.1017/s0269964800004502.

Chicago

Sadeh, Ilan. 1996. “Universal Data Compression Algorithm Based on Approximate String Matching.” Probability in the Engineering and Informational Sciences 10 (4): 465–486. https://doi.org/10.1017/s0269964800004502.

Harvard

Sadeh, I. (1996) ‘Universal Data Compression Algorithm Based on Approximate String Matching’, Probability in the Engineering and Informational Sciences, 10(4), pp. 465–486. doi:10.1017/s0269964800004502.

IEEE

I. Sadeh, “Universal Data Compression Algorithm Based on Approximate String Matching,” Probability in the Engineering and Informational Sciences, vol. 10, no. 4, pp. 465–486, 1996, doi: 10.1017/s0269964800004502.

BibTeX

@article{sadeh1996universal,
  title     = {{Universal Data Compression Algorithm Based on Approximate String Matching}},
  author    = {Sadeh, Ilan},
  journal   = {Probability in the Engineering and Informational Sciences},
  year      = {1996},
  volume    = {10},
  number    = {4},
  pages     = {465--486},
  doi       = {10.1017/s0269964800004502},
  url       = {https://doi.org/10.1017/s0269964800004502}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression

  • universal compression
  • approximate string matching
  • source coding
  • block coding
  • empirical distribution
  • stationary ergodic sources
  • lossy compression
  • sequential encoding

Work with this paper

Most-cited papers in Mathematics

All highly cited Mathematics papers

Questions about this paper

How do I cite this paper in APA style?

Sadeh, I. (1996). Universal Data Compression Algorithm Based on Approximate String Matching. Probability in the Engineering and Informational Sciences, 10(4), 465–486. https://doi.org/10.1017/s0269964800004502

How many times has this paper been cited?

11 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

Ilan Sadeh.

What is the DOI of this paper?

10.1017/s0269964800004502. The permanent link is https://doi.org/10.1017/s0269964800004502.

Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.