Stringology: Some classic and some modern problems

S. 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
    PublisherSpringer Verlag
    Pages2
    Number of pages1
    ISBN (Print)9783540734369
    DOIs
    StatePublished - 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

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Fingerprint Dive into the research topics of 'Stringology: Some classic and some modern problems'. Together they form a unique fingerprint.

    Cite this