文献
J-GLOBAL ID:201702230658128596
整理番号:17A1625832
ストリングにおける最大近似ランの位置付け【Powered by NICT】
Locating maximal approximate runs in a string
著者 (6件):
Amit Mika
(Department of Computer Science, University of Haifa, Mount Carmel, Haifa, Israel)
,
Crochemore Maxime
(King’s College London, Strand, London WC2R 2LS, UK)
,
Crochemore Maxime
(Universite Paris-Est, Institut Gaspard-Monge, 77454 Marne-la-Vallee Cedex 2, France)
,
Landau Gad M.
(Department of Computer Science, University of Haifa, Mount Carmel, Haifa, Israel)
,
Landau Gad M.
(Department of Computer Science and Engineering, NYU Polytechnic School of Engineering, New York University, Brooklyn, NY, USA)
,
Sokol Dina
(Department of Computer and Information Science, Brooklyn College of the City University of New York, Brooklyn, NY, USA)
資料名:
Theoretical Computer Science
(Theoretical Computer Science)
巻:
700
ページ:
45-62
発行年:
2017年
JST資料番号:
T0022A
ISSN:
0304-3975
CODEN:
TCSDIQ
資料種別:
逐次刊行物 (A)
記事区分:
原著論文
発行国:
オランダ (NLD)
言語:
英語 (EN)