Augmenting suffix trees, with applications

Yossi Matias, Shanmugavelayutham Muthukrishnan, Süleyman Cenk Sahinalp, Jacob Ziv

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

    Abstract

    Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one algorithmic problem from each of these areas and present highly efficient (linear or near linear time) algorithms for both problems. Our algorithms rely on augmenting the suffix tree, a fundamental data structure in string algorithmics. The augmentations are nontrivial and they form the technical crux of this paper. In particular, they consist of adding extra edges to suffix trees, resulting in Directed Acyclic Graphs (DAGs). Our algorithms construct these "suffix DAGs" and manipulate them to solve the two problems efficiently.

    Original languageEnglish (US)
    Title of host publicationAlgorithms, ESA 1998 - 6th Annual European Symposium, Proceedings
    PublisherSpringer-Verlag
    Pages67-78
    Number of pages12
    ISBN (Print)3540648488, 9783540648482
    StatePublished - Jan 1 1998
    Event6th Annual European Symposium on Algorithms, ESA 1998 - Venice, Italy
    Duration: Aug 24 1998Aug 26 1998

    Publication series

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

    Conference

    Conference6th Annual European Symposium on Algorithms, ESA 1998
    CountryItaly
    CityVenice
    Period8/24/988/26/98

    Fingerprint

    Suffix Tree
    Directed Acyclic Graph
    Strings
    Suffix
    Data compression
    Data Compression
    Augmentation
    Linear-time Algorithm
    Information retrieval
    Information Retrieval
    Data structures
    Data Structures

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    Matias, Y., Muthukrishnan, S., Sahinalp, S. C., & Ziv, J. (1998). Augmenting suffix trees, with applications. In Algorithms, ESA 1998 - 6th Annual European Symposium, Proceedings (pp. 67-78). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1461 LNCS). Springer-Verlag.

    Augmenting suffix trees, with applications. / Matias, Yossi; Muthukrishnan, Shanmugavelayutham; Sahinalp, Süleyman Cenk; Ziv, Jacob.

    Algorithms, ESA 1998 - 6th Annual European Symposium, Proceedings. Springer-Verlag, 1998. p. 67-78 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1461 LNCS).

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

    Matias, Y, Muthukrishnan, S, Sahinalp, SC & Ziv, J 1998, Augmenting suffix trees, with applications. in Algorithms, ESA 1998 - 6th Annual European Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1461 LNCS, Springer-Verlag, pp. 67-78, 6th Annual European Symposium on Algorithms, ESA 1998, Venice, Italy, 8/24/98.
    Matias Y, Muthukrishnan S, Sahinalp SC, Ziv J. Augmenting suffix trees, with applications. In Algorithms, ESA 1998 - 6th Annual European Symposium, Proceedings. Springer-Verlag. 1998. p. 67-78. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    Matias, Yossi ; Muthukrishnan, Shanmugavelayutham ; Sahinalp, Süleyman Cenk ; Ziv, Jacob. / Augmenting suffix trees, with applications. Algorithms, ESA 1998 - 6th Annual European Symposium, Proceedings. Springer-Verlag, 1998. pp. 67-78 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{26e6c0eb9a5c4de083ec2f0852f20ddc,
    title = "Augmenting suffix trees, with applications",
    abstract = "Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one algorithmic problem from each of these areas and present highly efficient (linear or near linear time) algorithms for both problems. Our algorithms rely on augmenting the suffix tree, a fundamental data structure in string algorithmics. The augmentations are nontrivial and they form the technical crux of this paper. In particular, they consist of adding extra edges to suffix trees, resulting in Directed Acyclic Graphs (DAGs). Our algorithms construct these {"}suffix DAGs{"} and manipulate them to solve the two problems efficiently.",
    author = "Yossi Matias and Shanmugavelayutham Muthukrishnan and Sahinalp, {S{\"u}leyman Cenk} and Jacob Ziv",
    year = "1998",
    month = "1",
    day = "1",
    language = "English (US)",
    isbn = "3540648488",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer-Verlag",
    pages = "67--78",
    booktitle = "Algorithms, ESA 1998 - 6th Annual European Symposium, Proceedings",

    }

    TY - GEN

    T1 - Augmenting suffix trees, with applications

    AU - Matias, Yossi

    AU - Muthukrishnan, Shanmugavelayutham

    AU - Sahinalp, Süleyman Cenk

    AU - Ziv, Jacob

    PY - 1998/1/1

    Y1 - 1998/1/1

    N2 - Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one algorithmic problem from each of these areas and present highly efficient (linear or near linear time) algorithms for both problems. Our algorithms rely on augmenting the suffix tree, a fundamental data structure in string algorithmics. The augmentations are nontrivial and they form the technical crux of this paper. In particular, they consist of adding extra edges to suffix trees, resulting in Directed Acyclic Graphs (DAGs). Our algorithms construct these "suffix DAGs" and manipulate them to solve the two problems efficiently.

    AB - Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one algorithmic problem from each of these areas and present highly efficient (linear or near linear time) algorithms for both problems. Our algorithms rely on augmenting the suffix tree, a fundamental data structure in string algorithmics. The augmentations are nontrivial and they form the technical crux of this paper. In particular, they consist of adding extra edges to suffix trees, resulting in Directed Acyclic Graphs (DAGs). Our algorithms construct these "suffix DAGs" and manipulate them to solve the two problems efficiently.

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

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

    M3 - Conference contribution

    AN - SCOPUS:84896750316

    SN - 3540648488

    SN - 9783540648482

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

    SP - 67

    EP - 78

    BT - Algorithms, ESA 1998 - 6th Annual European Symposium, Proceedings

    PB - Springer-Verlag

    ER -