Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
IEICE Technical Committee Submission System
Conference Paper's Information		 Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2021-05-08 11:00
An Extension of Cartesian Tree Matching Based-on Subsequences
Takeshi Kai, Kenta Mitsuyoshi, Isamu Furuya, Hiroki Arimura (Hokkaido Univ.) COMP2021-6
Abstract (in Japanese) (See Japanese page) 
(in English) In this paper, we consider the Cartesian tree matching problem, originally introduced by Park et al. in 2019. Despite of its usefulness in finance data analysis, the requirement for consecutive substrings seems too rigid to handle real world sequences with potential errors. By relaxing this requirement, we propose its extension, called Cartesian tree subsequence matching problem, where we allow patterns to match non-consecutive subsequences of a text sequence rather than consecutive substrings. For this new problem, we propose an efficient algorithm based on dynamic programming for the problem. Furthermore, we also presented algorithms for computing traces of matching, and for the sliding window version of the matching problem.
Keyword (in Japanese) (See Japanese page) 
(in English) String alogorithm / subsequence matching / dynamic programming / slinding window / / / /  
Reference Info. IEICE Tech. Rep., vol. 121, no. 11, COMP2021-6, pp. 39-45, May 2021.
Paper # COMP2021-6 
Date of Issue 2021-04-30 (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 COMP2021-6

Conference Information
Committee COMP IPSJ-AL  
Conference Date 2021-05-07 - 2021-05-08 
Place (in Japanese) (See Japanese page) 
Place (in English) Online 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2021-05-COMP-AL 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) An Extension of Cartesian Tree Matching Based-on Subsequences 
Sub Title (in English)  
Keyword(1) String alogorithm  
Keyword(2) subsequence matching  
Keyword(3) dynamic programming  
Keyword(4) slinding window  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Takeshi Kai  
1st Author's Affiliation Hokkaido University (Hokkaido Univ.)
2nd Author's Name Kenta Mitsuyoshi  
2nd Author's Affiliation Hokkaido University (Hokkaido Univ.)
3rd Author's Name Isamu Furuya  
3rd Author's Affiliation Hokkaido University (Hokkaido Univ.)
4th Author's Name Hiroki Arimura  
4th Author's Affiliation Hokkaido University (Hokkaido 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 ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2021-05-08 11:00:00 
Presentation Time 30 minutes 
Registration for COMP 
Paper # COMP2021-6 
Volume (vol) vol.121 
Number (no) no.11 
Page pp.39-45 
#Pages 7 
Date of Issue 2021-04-30 (COMP) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan