ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
32
views
0
references
Top references
cited by
1
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,358
similar
All similar
Record
: found
Abstract
: not found
Article
: not found
Linear-time longest common-prefix computation in suffix arrays and its applications.: Jerusalem, Israel.
Author(s):
T Kasai
,
G Lee
,
H Arimura
,
S. Arikawa
,
K Park
Publication date:
2002
Read this article at
ScienceOpen
Bookmark
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Genomic Prediction
Data availability:
ScienceOpen disciplines:
Genetics
,
Life sciences
Comments
Comment on this article
Sign in to comment
Similar content
1,358
Computing the longest common prefix array based on the Burrows–Wheeler transform
Authors:
Thomas Schnattinger
,
Timo Beller
,
Simon Gog
…
Clindamycin resistance among Staphylococcus aureus strains in Israel: implications for empirical treatment of skin and soft tissue infections.
Authors:
Jacqueline Komerska
,
Bracha Sheinberg
,
Eli Somekh
…
Dominant News Frames, Society’s Memory, and the African Asylum Seekers’ Protest in Israel
Authors:
N Tirosh
See all similar
Cited by
1
De novo identification of LTR retrotransposons in eukaryotic genomes
Authors:
Mina Rho
,
Jeong-Hyeon Choi
,
Sun Ae Kim
…
See all cited by