Augmenting suffix trees, with applications

Yossi Matias; S. Muthukrishnan; Süleyman Cenk Sahinalp; Jacob Ziv

Augmenting suffix trees, with applications

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

School of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 language	English
Title of host publication	Algorithms, ESA 1998 - 6th Annual European Symposium, Proceedings
Publisher	Springer Verlag
Pages	67-78
Number of pages	12
ISBN (Print)	3540648488, 9783540648482
State	Published - 1998
Event	6th Annual European Symposium on Algorithms, ESA 1998 - Venice, Italy Duration: 24 Aug 1998 → 26 Aug 1998

Publication series

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

Conference

Conference	6th Annual European Symposium on Algorithms, ESA 1998
Country/Territory	Italy
City	Venice
Period	24/08/98 → 26/08/98

Cite this

@inproceedings{ffd68cc5ddb8484cb2907a1d10c0ccb9,

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 S. Muthukrishnan and Sahinalp, {S{\"u}leyman Cenk} and Jacob Ziv",

year = "1998",

language = "אנגלית",

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",

note = "null ; Conference date: 24-08-1998 Through 26-08-1998",

}

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, 24/08/98.

Augmenting suffix trees, with applications. / Matias, Yossi; Muthukrishnan, S.; Sahinalp, Süleyman Cenk et al.

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 proceeding › Conference contribution › peer-review

TY - GEN

T1 - Augmenting suffix trees, with applications

AU - Matias, Yossi

AU - Muthukrishnan, S.

AU - Sahinalp, Süleyman Cenk

AU - Ziv, Jacob

PY - 1998

Y1 - 1998

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

M3 - פרסום בספר כנס

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

Y2 - 24 August 1998 through 26 August 1998

ER -

Augmenting suffix trees, with applications

Abstract

Publication series

Conference

Other files and links

Fingerprint

Cite this