Paper Abstract and Keywords |
Presentation |
2019-12-13 10:50
An exact string matching algorithm based on the distances of q-gram occurrences Satoshi Kobayashi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara (Tohoku Univ.) COMP2019-33 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
Given a text $T$ of length $n$ and a pattern $P$ of length $m$, the exact string matching problem is a task to find all occurrences of $P$ in $T$. In this study, we propose an algorithm that solves this problem in $O((n + m)q) $ time considering the distance between the most recent occurrences of the same $q$-gram contained in $ P $. We also compare the execution speed with existing algorithms using datasets such as English text and genome sequences and show that our algorithm is practically fast. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
string matching / algorithm / / / / / / |
Reference Info. |
IEICE Tech. Rep., vol. 119, no. 340, COMP2019-33, pp. 31-38, Dec. 2019. |
Paper # |
COMP2019-33 |
Date of Issue |
2019-12-06 (COMP) |
ISSN |
Online edition: ISSN 2432-6380 |
Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
Download PDF |
COMP2019-33 |
Conference Information |
Committee |
COMP |
Conference Date |
2019-12-13 - 2019-12-13 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Ikaho Seminar House, Gunma University |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
|
Paper Information |
Registration To |
COMP |
Conference Code |
2019-12-COMP |
Language |
Japanese |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
An exact string matching algorithm based on the distances of q-gram occurrences |
Sub Title (in English) |
|
Keyword(1) |
string matching |
Keyword(2) |
algorithm |
Keyword(3) |
|
Keyword(4) |
|
Keyword(5) |
|
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Satoshi Kobayashi |
1st Author's Affiliation |
Tohoku University (Tohoku Univ.) |
2nd Author's Name |
Diptarama Hendrian |
2nd Author's Affiliation |
Tohoku University (Tohoku Univ.) |
3rd Author's Name |
Ryo Yoshinaka |
3rd Author's Affiliation |
Tohoku University (Tohoku Univ.) |
4th Author's Name |
Ayumi Shinohara |
4th Author's Affiliation |
Tohoku University (Tohoku Univ.) |
5th Author's Name |
|
5th Author's Affiliation |
() |
6th Author's Name |
|
6th Author's Affiliation |
() |
7th Author's Name |
|
7th Author's Affiliation |
() |
8th Author's Name |
|
8th Author's Affiliation |
() |
9th Author's Name |
|
9th Author's Affiliation |
() |
10th Author's Name |
|
10th Author's Affiliation |
() |
11th Author's Name |
|
11th Author's Affiliation |
() |
12th Author's Name |
|
12th Author's Affiliation |
() |
13th Author's Name |
|
13th Author's Affiliation |
() |
14th Author's Name |
|
14th Author's Affiliation |
() |
15th Author's Name |
|
15th Author's Affiliation |
() |
16th Author's Name |
|
16th Author's Affiliation |
() |
17th Author's Name |
|
17th Author's Affiliation |
() |
18th Author's Name |
|
18th Author's Affiliation |
() |
19th Author's Name |
|
19th Author's Affiliation |
() |
20th Author's Name |
|
20th Author's Affiliation |
() |
Speaker |
Author-1 |
Date Time |
2019-12-13 10:50:00 |
Presentation Time |
25 minutes |
Registration for |
COMP |
Paper # |
COMP2019-33 |
Volume (vol) |
vol.119 |
Number (no) |
no.340 |
Page |
pp.31-38 |
#Pages |
8 |
Date of Issue |
2019-12-06 (COMP) |
|