Faster Sparse Suffix Sorting

Tomohiro I; Juha Kärkkäinen; Dominik Kempa

doi:10.4230/LIPIcs.STACS.2014.386

Faster Sparse Suffix Sorting

Tomohiro I, Juha Kärkkäinen, Dominik Kempa

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

Original language	English
Title of host publication	31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Editors	Ernst W. Mayr, Natacha Portier
Number of pages	11
Place of Publication	Wadern
Publisher	Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Publication date	2014
Pages	386-396
ISBN (Electronic)	978-3-939897-65-1
DOIs	https://doi.org/10.4230/LIPIcs.STACS.2014.386
Publication status	Published - 2014
MoE publication type	A4 Article in conference proceedings
Event	Symposium on Theoretical Aspects of Computer Science - Lyon, France Duration: 5 Mar 2014 → 8 Mar 2014 Conference number: 31

Publication series

Name	Leibniz International Proceedings in Informatics (LIPIcs)
Publisher	Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik
Volume	25
ISSN (Print)	1868-8969

Bibliographical note

Jufo_ID: 59045 ; lyhenne: STACS.

Fields of Science

113 Computer and information sciences
string algorithms
sparse suffix sorting
sparse suffix trees
Karp-Rabin fingerprints
space-time tradeoffs

Access to Document

10.4230/LIPIcs.STACS.2014.386

http://drops.dagstuhl.de/portals/extern/index.php?semnr=14001

Cite this

I, T., Kärkkäinen, J., & Kempa, D. (2014). Faster Sparse Suffix Sorting. In E. W. Mayr, & N. Portier (Eds.), 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014) (pp. 386-396). (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 25). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2014.386

@inproceedings{5d1289cd06764efc9aced7c3d0fd4b9c,

title = "Faster Sparse Suffix Sorting",

keywords = "113 Computer and information sciences, string algorithms, sparse suffix sorting, sparse suffix trees, Karp-Rabin fingerprints, space-time tradeoffs",

author = "Tomohiro I and Juha K{\"a}rkk{\"a}inen and Dominik Kempa",

note = "Jufo_ID: 59045 ; lyhenne: STACS. ; Symposium on Theoretical Aspects of Computer Science ; Conference date: 05-03-2014 Through 08-03-2014",

year = "2014",

doi = "10.4230/LIPIcs.STACS.2014.386",

language = "English",

series = "Leibniz International Proceedings in Informatics (LIPIcs)",

publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik",

pages = "386--396",

editor = "Mayr, {Ernst W.} and Natacha Portier",

booktitle = "31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)",

address = "Germany",

}

I, T, Kärkkäinen, J & Kempa, D 2014, Faster Sparse Suffix Sorting. in EW Mayr & N Portier (eds), 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics (LIPIcs), vol. 25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Wadern, pp. 386-396, Symposium on Theoretical Aspects of Computer Science, Lyon, France, 05/03/2014. https://doi.org/10.4230/LIPIcs.STACS.2014.386

Faster Sparse Suffix Sorting. / I, Tomohiro; Kärkkäinen, Juha; Kempa, Dominik.
31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). ed. / Ernst W. Mayr; Natacha Portier. Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. p. 386-396 (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 25).

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

TY - GEN

T1 - Faster Sparse Suffix Sorting

AU - I, Tomohiro

AU - Kärkkäinen, Juha

AU - Kempa, Dominik

N1 - Conference code: 31

PY - 2014

Y1 - 2014

KW - 113 Computer and information sciences

KW - string algorithms

KW - sparse suffix sorting

KW - sparse suffix trees

KW - Karp-Rabin fingerprints

KW - space-time tradeoffs

U2 - 10.4230/LIPIcs.STACS.2014.386

DO - 10.4230/LIPIcs.STACS.2014.386

M3 - Conference contribution

T3 - Leibniz International Proceedings in Informatics (LIPIcs)

SP - 386

EP - 396

BT - 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)

A2 - Mayr, Ernst W.

A2 - Portier, Natacha

PB - Schloss Dagstuhl - Leibniz-Zentrum für Informatik

CY - Wadern

T2 - Symposium on Theoretical Aspects of Computer Science

Y2 - 5 March 2014 through 8 March 2014

ER -