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 2013-05-17 15:05
Efficient Enumeration of Directed Binary Perfect Phylogenies using Dynamic Programming
Kazuki Morito (SEIBU CONSTRUCTION), Toshiki Saitoh, Kazuaki Yamaguchi, Sumio Masuda (Kobe Univ.) COMP2013-12
Abstract (in Japanese) (See Japanese page) 
(in English) We consider an enumeration of directed binary perfect phylogenies from incomplete data. Recently, Kiyomi et al. proposed an enumeration algorithm for directed binary perfect phylogenies using ZDDs. A ZDD is a compact data structure for a family of sets provided with a rich family of set operations. Kiyomi’s algorithm constructs a ZDD which represents all directed binary perfect phylogenies using these operations. On the other
hand, Knuth proposed an algorithm for enumerating paths in a graph by using a ZDD. This method is based on a dynamic programming, and construct the objective ZDD, directly. In this paper, we propose an efficient algorithm for enumerating directed binary perfect phylogenies using the dynamic programming. We show an effectivity of our algorithm by computational experiment.
Keyword (in Japanese) (See Japanese page) 
(in English) directed binary perfect phylogeny / enumeration algorithm / dynamic programming / ZDD / / / /  
Reference Info. IEICE Tech. Rep., vol. 113, no. 50, COMP2013-12, pp. 63-70, May 2013.
Paper # COMP2013-12 
Date of Issue 2013-05-10 (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 COMP2013-12

Conference Information
Committee COMP IPSJ-AL  
Conference Date 2013-05-17 - 2013-05-18 
Place (in Japanese) (See Japanese page) 
Place (in English) Otaru University of Commerce 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2013-05-COMP-AL 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Efficient Enumeration of Directed Binary Perfect Phylogenies using Dynamic Programming 
Sub Title (in English)  
Keyword(1) directed binary perfect phylogeny  
Keyword(2) enumeration algorithm  
Keyword(3) dynamic programming  
Keyword(4) ZDD  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Kazuki Morito  
1st Author's Affiliation SEIBU CONSTRUCTION (SEIBU CONSTRUCTION)
2nd Author's Name Toshiki Saitoh  
2nd Author's Affiliation Kobe University (Kobe Univ.)
3rd Author's Name Kazuaki Yamaguchi  
3rd Author's Affiliation Kobe University (Kobe Univ.)
4th Author's Name Sumio Masuda  
4th Author's Affiliation Kobe University (Kobe 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-2 
Date Time 2013-05-17 15:05:00 
Presentation Time 25 minutes 
Registration for COMP 
Paper # COMP2013-12 
Volume (vol) vol.113 
Number (no) no.50 
Page pp.63-70 
#Pages 8 
Date of Issue 2013-05-10 (COMP) 

[Return to Top Page]

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