Stringology: Some classic and some modern problems

S. Muthukrishnan

doi:10.1007/978-3-540-73437-6_2

Stringology: Some classic and some modern problems

S. Muthukrishnan

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings
Publisher	Springer Verlag
Pages	2
Number of pages	1
ISBN (Print)	9783540734369
DOIs	https://doi.org/10.1007/978-3-540-73437-6_2
State	Published - 2007
Event	18th Annual Symposium on Combinatorial Pattern Matching, CPM 2007 - London, ON, Canada Duration: Jul 9 2007 → Jul 11 2007

Publication series

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

Conference

Conference	18th Annual Symposium on Combinatorial Pattern Matching, CPM 2007
Country/Territory	Canada
City	London, ON
Period	7/9/07 → 7/11/07

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-540-73437-6_2

Cite this

Muthukrishnan, S. (2007). Stringology: Some classic and some modern problems. In Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings (pp. 2). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4580 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-73437-6_2

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

Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings. Springer Verlag, 2007. p. 2 (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 proceeding › Conference 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, Springer Verlag, pp. 2, 18th Annual Symposium on Combinatorial Pattern Matching, CPM 2007, London, ON, Canada, 7/9/07. https://doi.org/10.1007/978-3-540-73437-6_2

@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 = "S. Muthukrishnan",

year = "2007",

doi = "10.1007/978-3-540-73437-6_2",

language = "English (US)",

isbn = "9783540734369",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "2",

booktitle = "Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings",

note = "18th Annual Symposium on Combinatorial Pattern Matching, CPM 2007 ; Conference date: 09-07-2007 Through 11-07-2007",

}

TY - GEN

T1 - Stringology

T2 - 18th Annual Symposium on Combinatorial Pattern Matching, CPM 2007

AU - Muthukrishnan, S.

PY - 2007

Y1 - 2007

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

U2 - 10.1007/978-3-540-73437-6_2

DO - 10.1007/978-3-540-73437-6_2

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)

SP - 2

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

PB - Springer Verlag

Y2 - 9 July 2007 through 11 July 2007

ER -

Stringology: Some classic and some modern problems

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this