Efficient string matching algorithms for combinatorial universal denoising

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

    Research output: Contribution to journalConference article

    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 languageEnglish (US)
    Pages (from-to)153-162
    Number of pages10
    JournalData Compression Conference Proceedings
    StatePublished - Oct 26 2005
    EventDCC 2005: Data Compression Conference - Snowbird, UT, United States
    Duration: Mar 29 2005Mar 31 2005

    Fingerprint

    String searching algorithms
    Sorting

    ASJC Scopus subject areas

    • Computer Networks and Communications

    Cite this

    Efficient string matching algorithms for combinatorial universal denoising. / Chen, S.; Diggavi, S.; Dusad, S.; Muthukrishnan, Shanmugavelayutham.

    In: Data Compression Conference Proceedings, 26.10.2005, p. 153-162.

    Research output: Contribution to journalConference article

    Chen, S. ; Diggavi, S. ; Dusad, S. ; Muthukrishnan, Shanmugavelayutham. / Efficient string matching algorithms for combinatorial universal denoising. In: Data Compression Conference Proceedings. 2005 ; pp. 153-162.
    @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 Shanmugavelayutham Muthukrishnan",
    year = "2005",
    month = "10",
    day = "26",
    language = "English (US)",
    pages = "153--162",
    journal = "Proceedings of the Data Compression Conference",
    issn = "1068-0314",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",

    }

    TY - JOUR

    T1 - Efficient string matching algorithms for combinatorial universal denoising

    AU - Chen, S.

    AU - Diggavi, S.

    AU - Dusad, S.

    AU - Muthukrishnan, Shanmugavelayutham

    PY - 2005/10/26

    Y1 - 2005/10/26

    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

    SP - 153

    EP - 162

    JO - Proceedings of the Data Compression Conference

    JF - Proceedings of the Data Compression Conference

    SN - 1068-0314

    ER -