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 2011-04-22 10:50
Construction of a SeqBDD representing a set of reversed sequences
Hiroshi Aoki, Shigeru Yamashita (Ritsumeikan Univ.), Shin-ichi Minato (Hokkaido Univ.) COMP2011-3
Abstract (in Japanese) (See Japanese page) 
(in English) A trie is a data structure representing a set of sequences by sharing the same prefixes between sequences. Thanks to this sharing, prefix searches on a trie is performed efficiently. Constructing a trie representing a set of reversed sequences is useful for suffix searches on the original sequences. This is because a prefix search on reversed sequences corresponds to a suffix search on the original sequences. A Sequence Binary Decision Diagram (SeqBDD) also represents a set of sequences compactly by sharing the same prefixes between the sequences. In addition, a SeqBDD can share suffixes between the sequences unlike a trie. In this paper, we propose a construction method of a SeqBDD representing a set of the reversed sequences from a given SeqBDD. Our method traverses each node in a SeqBDD only one time since it traverses the nodes based on the topological sorting. Hence, our method is more efficient than a simple recursive method that traverses the same nodes many times. Our experimental results show that our method constructs a SeqBDD representing a set of reversed sequences more efficiently than a simple recursive method when there are many common prefixes and/or suffixes in given sequences.
Keyword (in Japanese) (See Japanese page) 
(in English) SeqBDD / Trie / set of reversed sequences / single-wild-card query / SeqBDDMap / / /  
Reference Info. IEICE Tech. Rep., vol. 111, no. 20, COMP2011-3, pp. 17-23, April 2011.
Paper # COMP2011-3 
Date of Issue 2011-04-15 (COMP) 
ISSN Print edition: ISSN 0913-5685    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 COMP2011-3

Conference Information
Committee COMP  
Conference Date 2011-04-22 - 2011-04-22 
Place (in Japanese) (See Japanese page) 
Place (in English) Kyoto University 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2011-04-COMP 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Construction of a SeqBDD representing a set of reversed sequences 
Sub Title (in English)  
Keyword(1) SeqBDD  
Keyword(2) Trie  
Keyword(3) set of reversed sequences  
Keyword(4) single-wild-card query  
Keyword(5) SeqBDDMap  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Hiroshi Aoki  
1st Author's Affiliation Ritsumeikan University (Ritsumeikan Univ.)
2nd Author's Name Shigeru Yamashita  
2nd Author's Affiliation Ritsumeikan University (Ritsumeikan Univ.)
3rd Author's Name Shin-ichi Minato  
3rd Author's Affiliation Hokkaido University (Hokkaido Univ.)
4th Author's Name  
4th Author's Affiliation ()
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 2011-04-22 10:50:00 
Presentation Time 35 minutes 
Registration for COMP 
Paper # COMP2011-3 
Volume (vol) vol.111 
Number (no) no.20 
Page pp.17-23 
#Pages 7 
Date of Issue 2011-04-15 (COMP) 

[Return to Top Page]

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