Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
14
views
0
references
Top references
cited by
1
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,703
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Combinatorial Pattern Matching
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
other
Author(s):
Kazuyuki Narisawa
,
Shunsuke Inenaga
,
Hideo Bannai
,
Masayuki Takeda
Publication date
(Print):
2007
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
ScienceOpen Research
Author and book information
Book Chapter
Pages
: 340-351
DOI:
10.1007/978-3-540-73437-6_34
SO-VID:
4c1b6271-a6be-4f76-8c97-e4857be03f1d
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 63
Self-normalised Distance with Don’t Cares
pp. 205
Space-Efficient Algorithms for Document Retrieval
pp. 216
Compressed Text Indexes with Fast Locate
pp. 228
Processing Compressed Texts: A Tractability Border
pp. 286
Two-Dimensional Range Minimum Queries
pp. 340
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
Similar content
2,703
Reconstructing Strings from Substrings with Quantum Queries
Authors:
Richard Cleve
,
Kazuo Iwama
,
François Le Gall
…
Optimal canonization of all substrings of a string
Authors:
A Apostolico
,
M. CROCHEMORE
,
M Crochemore
Experiments with a very fast substring search algorithm
Authors:
P Smith
See all similar
Cited by
1
IDF for Word N-grams
Authors:
Masumi Shirakawa
,
Takahiro Hara
,
Shojiro Nishio
See all cited by