Stringology: Some classic and some modern problems

Shanmugavelayutham Muthukrishnan

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

    Abstract

    We examine some of the classic problems related to suffix trees from 70's and show some recent results on sorting suffixes with small space and suffix selection. Further, we introduce modern versions of suffix sorting and their application to XML processing. The study of combinatorial aspects of strings continues to flourish, and we present several open problems with modern applications.

    Original languageEnglish (US)
    Title of host publicationCombinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings
    Number of pages1
    StatePublished - Dec 1 2007
    Event18th Annual Symposium on Combinatorial Pattern Matching, CPM 2007 - London, ON, Canada
    Duration: Jul 9 2007Jul 11 2007

    Publication series

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

    Conference

    Conference18th Annual Symposium on Combinatorial Pattern Matching, CPM 2007
    CountryCanada
    CityLondon, ON
    Period7/9/077/11/07

    Fingerprint

    String searching algorithms
    Suffix
    Sorting
    XML
    Suffix Tree
    Open Problems
    Continue
    Processing
    Strings

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    Muthukrishnan, S. (2007). Stringology: Some classic and some modern problems. In Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4580 LNCS).

    Stringology : Some classic and some modern problems. / Muthukrishnan, Shanmugavelayutham.

    Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings. 2007. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4580 LNCS).

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

    Muthukrishnan, S 2007, Stringology: Some classic and some modern problems. in Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4580 LNCS, 18th Annual Symposium on Combinatorial Pattern Matching, CPM 2007, London, ON, Canada, 7/9/07.
    Muthukrishnan S. Stringology: Some classic and some modern problems. In Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings. 2007. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    Muthukrishnan, Shanmugavelayutham. / Stringology : Some classic and some modern problems. Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings. 2007. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{dd5617c70ba94356bcdbf29fd3abc9d2,
    title = "Stringology: Some classic and some modern problems",
    abstract = "We examine some of the classic problems related to suffix trees from 70's and show some recent results on sorting suffixes with small space and suffix selection. Further, we introduce modern versions of suffix sorting and their application to XML processing. The study of combinatorial aspects of strings continues to flourish, and we present several open problems with modern applications.",
    author = "Shanmugavelayutham Muthukrishnan",
    year = "2007",
    month = "12",
    day = "1",
    language = "English (US)",
    isbn = "9783540734369",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    booktitle = "Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings",

    }

    TY - GEN

    T1 - Stringology

    T2 - Some classic and some modern problems

    AU - Muthukrishnan, Shanmugavelayutham

    PY - 2007/12/1

    Y1 - 2007/12/1

    N2 - We examine some of the classic problems related to suffix trees from 70's and show some recent results on sorting suffixes with small space and suffix selection. Further, we introduce modern versions of suffix sorting and their application to XML processing. The study of combinatorial aspects of strings continues to flourish, and we present several open problems with modern applications.

    AB - We examine some of the classic problems related to suffix trees from 70's and show some recent results on sorting suffixes with small space and suffix selection. Further, we introduce modern versions of suffix sorting and their application to XML processing. The study of combinatorial aspects of strings continues to flourish, and we present several open problems with modern applications.

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

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

    M3 - Conference contribution

    AN - SCOPUS:37849034700

    SN - 9783540734369

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

    BT - Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings

    ER -