String Processing and Information Retrieval - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783319674278, 9783319674285

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Mining Bit-Parallel LCS-length Algorithms

String Processing and Information Retrieval - Lecture Notes in Computer Science ◽

10.1007/978-3-319-67428-5_18 ◽

2017 ◽

pp. 214-220

Author(s):

Heikki Hyyrö

Get full-text (via PubEx)

Faster Practical Block Compression for Rank/Select Dictionaries

String Processing and Information Retrieval - Lecture Notes in Computer Science ◽

10.1007/978-3-319-67428-5_20 ◽

2017 ◽

pp. 234-240

Author(s):

Yusaku Kaneta

Get full-text (via PubEx)

Efficient Compression and Indexing of Trajectories

String Processing and Information Retrieval - Lecture Notes in Computer Science ◽

10.1007/978-3-319-67428-5_10 ◽

2017 ◽

pp. 103-115 ◽

Cited By ~ 3

Author(s):

Nieves R. Brisaboa ◽

Travis Gagie ◽

Adrián Gómez-Brandón ◽

Gonzalo Navarro ◽

José R. Paramá

Get full-text (via PubEx)

Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries

String Processing and Information Retrieval - Lecture Notes in Computer Science ◽

10.1007/978-3-319-67428-5_19 ◽

2017 ◽

pp. 221-233 ◽

Cited By ~ 4

Author(s):

Shunsuke Kanda ◽

Kazuhiro Morita ◽

Masao Fuketa

Keyword(s):

Practical Implementation

Get full-text (via PubEx)

On Suffix Tree Breadth

String Processing and Information Retrieval - Lecture Notes in Computer Science ◽

10.1007/978-3-319-67428-5_6 ◽

2017 ◽

pp. 68-73 ◽

Cited By ~ 1

Author(s):

Golnaz Badkobeh ◽

Juha Kärkkäinen ◽

Simon J. Puglisi ◽

Bella Zhukova

Keyword(s):

Suffix Tree

Get full-text (via PubEx)

Counting Palindromes in Substrings

String Processing and Information Retrieval - Lecture Notes in Computer Science ◽

10.1007/978-3-319-67428-5_25 ◽

2017 ◽

pp. 290-303 ◽

Cited By ~ 1

Author(s):

Mikhail Rubinchik ◽

Arseny M. Shur

Get full-text (via PubEx)

Fast Construction of Compressed Web Graphs

String Processing and Information Retrieval - Lecture Notes in Computer Science ◽

10.1007/978-3-319-67428-5_11 ◽

2017 ◽

pp. 116-128

Author(s):

Jan Broß ◽

Simon Gog ◽

Matthias Hauck ◽

Marcus Paradies

Keyword(s):

Web Graphs

Get full-text (via PubEx)

Greedy Shortest Common Superstring Approximation in Compact Space

String Processing and Information Retrieval - Lecture Notes in Computer Science ◽

10.1007/978-3-319-67428-5_1 ◽

2017 ◽

pp. 1-13

Author(s):

Jarno Alanko ◽

Tuukka Norri

Keyword(s):

Compact Space ◽

Shortest Common Superstring

Get full-text (via PubEx)

Regular Abelian Periods and Longest Common Abelian Factors on Run-Length Encoded Strings

String Processing and Information Retrieval - Lecture Notes in Computer Science ◽

10.1007/978-3-319-67428-5_17 ◽

2017 ◽

pp. 208-213

Author(s):

Szymon Grabowski

Keyword(s):

Run Length

Get full-text (via PubEx)

Tight Bounds for Top Tree Compression

String Processing and Information Retrieval - Lecture Notes in Computer Science ◽

10.1007/978-3-319-67428-5_9 ◽

2017 ◽

pp. 97-102 ◽

Cited By ~ 2

Author(s):

Philip Bille ◽

Finn Fernstrøm ◽

Inge Li Gørtz

Keyword(s):

Tree Compression

Get full-text (via PubEx)

String Processing and Information Retrieval - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Mining Bit-Parallel LCS-length Algorithms

Faster Practical Block Compression for Rank/Select Dictionaries

Efficient Compression and Indexing of Trajectories

Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries

On Suffix Tree Breadth

Counting Palindromes in Substrings

Fast Construction of Compressed Web Graphs

Greedy Shortest Common Superstring Approximation in Compact Space

Regular Abelian Periods and Longest Common Abelian Factors on Run-Length Encoded Strings

Tight Bounds for Top Tree Compression

String Processing and Information Retrieval - Lecture Notes in Computer Science
Latest Publications