New results and open problems related to non-standard stringology

Shanmugavelayutham Muthukrishnan

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    There are a number of string matching problems for which the best known algorithms rely on algebraic convolutions (an approach pioneered by Fischer and Paterson [FP74]). These include for instance the classical string matching with wild cards and the k-mismatches problem. In IMP94], the authors studied generalizations of these problems which they called the non-standard stringology. There they derived upper and lower bounds for non-standard string matching problems. In this paper, we pose several novel problems in the area of nonstandard stringology. Some we have been able to resolve here; others we leave open. Among the technical results in this paper are: 1. improved bounds for string matching when a symbol in the string matches at most d others (motivated by noisy string matching), 2. first-known bounds for approximately counting mismatches in noisy string matching as above, and 3. improved bounds for the k-witnesses problem and its applications. Our results are obtained by using the probabilistic proof technique and randomized algorithmic methods; these techniques, although standard, have seldom been used in combinatorial pattern matching.

    Original languageEnglish (US)
    Title of host publicationCombinatorial Pattern Matching - 6th Annual Symposium, CPM 1995, Proceedings
    EditorsZvi Galil, Esko Ukkonen
    PublisherSpringer-Verlag
    Pages298-317
    Number of pages20
    ISBN (Print)3540600442, 9783540600442
    DOIs
    StatePublished - Jan 1 1995
    Event6th Annual Symposium on Combinatorial Pattern Matching, CPM 1995 - Espoo, Finland
    Duration: Jul 5 1995Jul 7 1995

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume937
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Other

    Other6th Annual Symposium on Combinatorial Pattern Matching, CPM 1995
    CountryFinland
    CityEspoo
    Period7/5/957/7/95

    Fingerprint

    String searching algorithms
    String Matching
    Open Problems
    Pattern matching
    Convolution
    Matching Problem
    Pattern Matching
    Upper and Lower Bounds
    Counting
    Resolve
    Strings

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    Muthukrishnan, S. (1995). New results and open problems related to non-standard stringology. In Z. Galil, & E. Ukkonen (Eds.), Combinatorial Pattern Matching - 6th Annual Symposium, CPM 1995, Proceedings (pp. 298-317). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 937). Springer-Verlag. https://doi.org/10.1007/3-540-60044-2_50

    New results and open problems related to non-standard stringology. / Muthukrishnan, Shanmugavelayutham.

    Combinatorial Pattern Matching - 6th Annual Symposium, CPM 1995, Proceedings. ed. / Zvi Galil; Esko Ukkonen. Springer-Verlag, 1995. p. 298-317 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 937).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Muthukrishnan, S 1995, New results and open problems related to non-standard stringology. in Z Galil & E Ukkonen (eds), Combinatorial Pattern Matching - 6th Annual Symposium, CPM 1995, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 937, Springer-Verlag, pp. 298-317, 6th Annual Symposium on Combinatorial Pattern Matching, CPM 1995, Espoo, Finland, 7/5/95. https://doi.org/10.1007/3-540-60044-2_50
    Muthukrishnan S. New results and open problems related to non-standard stringology. In Galil Z, Ukkonen E, editors, Combinatorial Pattern Matching - 6th Annual Symposium, CPM 1995, Proceedings. Springer-Verlag. 1995. p. 298-317. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-60044-2_50
    Muthukrishnan, Shanmugavelayutham. / New results and open problems related to non-standard stringology. Combinatorial Pattern Matching - 6th Annual Symposium, CPM 1995, Proceedings. editor / Zvi Galil ; Esko Ukkonen. Springer-Verlag, 1995. pp. 298-317 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{1a04f49afbb141429d05eb9bf1566bf1,
    title = "New results and open problems related to non-standard stringology",
    abstract = "There are a number of string matching problems for which the best known algorithms rely on algebraic convolutions (an approach pioneered by Fischer and Paterson [FP74]). These include for instance the classical string matching with wild cards and the k-mismatches problem. In IMP94], the authors studied generalizations of these problems which they called the non-standard stringology. There they derived upper and lower bounds for non-standard string matching problems. In this paper, we pose several novel problems in the area of nonstandard stringology. Some we have been able to resolve here; others we leave open. Among the technical results in this paper are: 1. improved bounds for string matching when a symbol in the string matches at most d others (motivated by noisy string matching), 2. first-known bounds for approximately counting mismatches in noisy string matching as above, and 3. improved bounds for the k-witnesses problem and its applications. Our results are obtained by using the probabilistic proof technique and randomized algorithmic methods; these techniques, although standard, have seldom been used in combinatorial pattern matching.",
    author = "Shanmugavelayutham Muthukrishnan",
    year = "1995",
    month = "1",
    day = "1",
    doi = "10.1007/3-540-60044-2_50",
    language = "English (US)",
    isbn = "3540600442",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer-Verlag",
    pages = "298--317",
    editor = "Zvi Galil and Esko Ukkonen",
    booktitle = "Combinatorial Pattern Matching - 6th Annual Symposium, CPM 1995, Proceedings",

    }

    TY - GEN

    T1 - New results and open problems related to non-standard stringology

    AU - Muthukrishnan, Shanmugavelayutham

    PY - 1995/1/1

    Y1 - 1995/1/1

    N2 - There are a number of string matching problems for which the best known algorithms rely on algebraic convolutions (an approach pioneered by Fischer and Paterson [FP74]). These include for instance the classical string matching with wild cards and the k-mismatches problem. In IMP94], the authors studied generalizations of these problems which they called the non-standard stringology. There they derived upper and lower bounds for non-standard string matching problems. In this paper, we pose several novel problems in the area of nonstandard stringology. Some we have been able to resolve here; others we leave open. Among the technical results in this paper are: 1. improved bounds for string matching when a symbol in the string matches at most d others (motivated by noisy string matching), 2. first-known bounds for approximately counting mismatches in noisy string matching as above, and 3. improved bounds for the k-witnesses problem and its applications. Our results are obtained by using the probabilistic proof technique and randomized algorithmic methods; these techniques, although standard, have seldom been used in combinatorial pattern matching.

    AB - There are a number of string matching problems for which the best known algorithms rely on algebraic convolutions (an approach pioneered by Fischer and Paterson [FP74]). These include for instance the classical string matching with wild cards and the k-mismatches problem. In IMP94], the authors studied generalizations of these problems which they called the non-standard stringology. There they derived upper and lower bounds for non-standard string matching problems. In this paper, we pose several novel problems in the area of nonstandard stringology. Some we have been able to resolve here; others we leave open. Among the technical results in this paper are: 1. improved bounds for string matching when a symbol in the string matches at most d others (motivated by noisy string matching), 2. first-known bounds for approximately counting mismatches in noisy string matching as above, and 3. improved bounds for the k-witnesses problem and its applications. Our results are obtained by using the probabilistic proof technique and randomized algorithmic methods; these techniques, although standard, have seldom been used in combinatorial pattern matching.

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

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

    U2 - 10.1007/3-540-60044-2_50

    DO - 10.1007/3-540-60044-2_50

    M3 - Conference contribution

    AN - SCOPUS:84957875060

    SN - 3540600442

    SN - 9783540600442

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 298

    EP - 317

    BT - Combinatorial Pattern Matching - 6th Annual Symposium, CPM 1995, Proceedings

    A2 - Galil, Zvi

    A2 - Ukkonen, Esko

    PB - Springer-Verlag

    ER -