Efficient string matching algorithms for combinatorial universal denoising

S. Chen; S. Diggavi; S. Dusad; S. Muthukrishnan

Efficient string matching algorithms for combinatorial universal denoising

S. Chen, S. Diggavi, S. Dusad, S. Muthukrishnan

Research output: Contribution to journal › Conference article › peer-review

Abstract

Inspired by the combinatorial denoising method DUDE [13], we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We also propose effective, efficient denoising error estimators so we can find the best denoising of an input sequence over different context lengths. Our methods are simple, drawing from string matching methods and radix sorting. We also present experimental results of our proposed algorithms.

Original language	English (US)
Pages (from-to)	153-162
Number of pages	10
Journal	Data Compression Conference Proceedings
State	Published - 2005
Event	DCC 2005: Data Compression Conference - Snowbird, UT, United States Duration: Mar 29 2005 → Mar 31 2005

ASJC Scopus subject areas

Computer Networks and Communications

Cite this

@article{2c89aafa1b4e44af810413deb0bd130d,

title = "Efficient string matching algorithms for combinatorial universal denoising",

abstract = "Inspired by the combinatorial denoising method DUDE [13], we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We also propose effective, efficient denoising error estimators so we can find the best denoising of an input sequence over different context lengths. Our methods are simple, drawing from string matching methods and radix sorting. We also present experimental results of our proposed algorithms.",

author = "S. Chen and S. Diggavi and S. Dusad and S. Muthukrishnan",

year = "2005",

language = "English (US)",

pages = "153--162",

journal = "Data Compression Conference Proceedings",

issn = "1068-0314",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "DCC 2005: Data Compression Conference ; Conference date: 29-03-2005 Through 31-03-2005",

}

TY - JOUR

T1 - Efficient string matching algorithms for combinatorial universal denoising

AU - Chen, S.

AU - Diggavi, S.

AU - Dusad, S.

AU - Muthukrishnan, S.

PY - 2005

Y1 - 2005

N2 - Inspired by the combinatorial denoising method DUDE [13], we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We also propose effective, efficient denoising error estimators so we can find the best denoising of an input sequence over different context lengths. Our methods are simple, drawing from string matching methods and radix sorting. We also present experimental results of our proposed algorithms.

AB - Inspired by the combinatorial denoising method DUDE [13], we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We also propose effective, efficient denoising error estimators so we can find the best denoising of an input sequence over different context lengths. Our methods are simple, drawing from string matching methods and radix sorting. We also present experimental results of our proposed algorithms.

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

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

M3 - Conference article

AN - SCOPUS:26944491474

SN - 1068-0314

SP - 153

EP - 162

JO - Data Compression Conference Proceedings

JF - Data Compression Conference Proceedings

T2 - DCC 2005: Data Compression Conference

Y2 - 29 March 2005 through 31 March 2005

ER -

Efficient string matching algorithms for combinatorial universal denoising

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this