Alphabet dependence in parameterized matching

Amihood Amir, Martin Farach, Shanmugavelayutham Muthukrishnan

    Research output: Contribution to journalArticle

    Abstract

    The classical pattern matching paradigm is that of seeking occurences of one string in another, where both strings are drawn from an alphabet set Σ. A recently introduced model is that of parameterized pattern matching. The main motivation for this scheme lies in software maintenance where program fragments are considered "identical" even if variables names are different. Besides the fixed symbols from Σ, strings under this model have additional symbols from a variable set Π and occurences of one string in the other are sought, where renaming of the variables from Π is allowed in a match. In this paper we provide an algorithm to find all occurences of a pattern string of length m in a text string of length n under the parameterized pattern matching model. Our algorithm takes time O(n log π), where π = min(m, |Π|), independent of |Σ|. Our algorithm is optimal since weshow that this dependence on |Π| is inherent to any algorithm for this problem in the comparison model.

    Original languageEnglish (US)
    Pages (from-to)111-115
    Number of pages5
    JournalInformation Processing Letters
    Volume49
    Issue number3
    DOIs
    StatePublished - Feb 11 1994

    Fingerprint

    Pattern matching
    Strings
    Pattern Matching
    Computer software maintenance
    Software Maintenance
    Model Comparison
    Fragment
    Paradigm
    Model

    Keywords

    • Algorithms
    • Analysis of algorithms
    • Parameterized string matching
    • Software maintenance
    • String matching

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Signal Processing
    • Information Systems
    • Computer Science Applications

    Cite this

    Alphabet dependence in parameterized matching. / Amir, Amihood; Farach, Martin; Muthukrishnan, Shanmugavelayutham.

    In: Information Processing Letters, Vol. 49, No. 3, 11.02.1994, p. 111-115.

    Research output: Contribution to journalArticle

    Amir, Amihood ; Farach, Martin ; Muthukrishnan, Shanmugavelayutham. / Alphabet dependence in parameterized matching. In: Information Processing Letters. 1994 ; Vol. 49, No. 3. pp. 111-115.
    @article{548357f58d5d4ac68bf12d965001f8ef,
    title = "Alphabet dependence in parameterized matching",
    abstract = "The classical pattern matching paradigm is that of seeking occurences of one string in another, where both strings are drawn from an alphabet set Σ. A recently introduced model is that of parameterized pattern matching. The main motivation for this scheme lies in software maintenance where program fragments are considered {"}identical{"} even if variables names are different. Besides the fixed symbols from Σ, strings under this model have additional symbols from a variable set Π and occurences of one string in the other are sought, where renaming of the variables from Π is allowed in a match. In this paper we provide an algorithm to find all occurences of a pattern string of length m in a text string of length n under the parameterized pattern matching model. Our algorithm takes time O(n log π), where π = min(m, |Π|), independent of |Σ|. Our algorithm is optimal since weshow that this dependence on |Π| is inherent to any algorithm for this problem in the comparison model.",
    keywords = "Algorithms, Analysis of algorithms, Parameterized string matching, Software maintenance, String matching",
    author = "Amihood Amir and Martin Farach and Shanmugavelayutham Muthukrishnan",
    year = "1994",
    month = "2",
    day = "11",
    doi = "10.1016/0020-0190(94)90086-8",
    language = "English (US)",
    volume = "49",
    pages = "111--115",
    journal = "Information Processing Letters",
    issn = "0020-0190",
    publisher = "Elsevier",
    number = "3",

    }

    TY - JOUR

    T1 - Alphabet dependence in parameterized matching

    AU - Amir, Amihood

    AU - Farach, Martin

    AU - Muthukrishnan, Shanmugavelayutham

    PY - 1994/2/11

    Y1 - 1994/2/11

    N2 - The classical pattern matching paradigm is that of seeking occurences of one string in another, where both strings are drawn from an alphabet set Σ. A recently introduced model is that of parameterized pattern matching. The main motivation for this scheme lies in software maintenance where program fragments are considered "identical" even if variables names are different. Besides the fixed symbols from Σ, strings under this model have additional symbols from a variable set Π and occurences of one string in the other are sought, where renaming of the variables from Π is allowed in a match. In this paper we provide an algorithm to find all occurences of a pattern string of length m in a text string of length n under the parameterized pattern matching model. Our algorithm takes time O(n log π), where π = min(m, |Π|), independent of |Σ|. Our algorithm is optimal since weshow that this dependence on |Π| is inherent to any algorithm for this problem in the comparison model.

    AB - The classical pattern matching paradigm is that of seeking occurences of one string in another, where both strings are drawn from an alphabet set Σ. A recently introduced model is that of parameterized pattern matching. The main motivation for this scheme lies in software maintenance where program fragments are considered "identical" even if variables names are different. Besides the fixed symbols from Σ, strings under this model have additional symbols from a variable set Π and occurences of one string in the other are sought, where renaming of the variables from Π is allowed in a match. In this paper we provide an algorithm to find all occurences of a pattern string of length m in a text string of length n under the parameterized pattern matching model. Our algorithm takes time O(n log π), where π = min(m, |Π|), independent of |Σ|. Our algorithm is optimal since weshow that this dependence on |Π| is inherent to any algorithm for this problem in the comparison model.

    KW - Algorithms

    KW - Analysis of algorithms

    KW - Parameterized string matching

    KW - Software maintenance

    KW - String matching

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

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

    U2 - 10.1016/0020-0190(94)90086-8

    DO - 10.1016/0020-0190(94)90086-8

    M3 - Article

    AN - SCOPUS:0028381833

    VL - 49

    SP - 111

    EP - 115

    JO - Information Processing Letters

    JF - Information Processing Letters

    SN - 0020-0190

    IS - 3

    ER -