Comparing and Combining Trees

2013 Fiscal Year Final Research Report

• Project/Area Number: 23700011
• Research Category: Grant-in-Aid for Young Scientists (B)
• Allocation Type: Multi-year Fund
• Research Field: Fundamental theory of informatics
• Research Institution: Kyoto University (2012-2013); Ochanomizu University (2011)
• Principal Investigator: JANSSON Jesper 京都大学, 白眉センター, 特定准教授 (60536100)
• Project Period (FY): 2011 – 2013
• Keywords: アルゴリズム / 計算複雑さ / 系統樹

Research Abstract

The purpose of this research project was to develop efficient algorithms for comparing and combining trees involving huge datasets. It focused on three particular topics: (i) Building a minimally resolved supertree; (ii) Constructing a consensus tree; and (iii) Measuring the similarity of two treelike structures.
Some new theoretical algorithms were designed and analyzed, and a number of related computational complexity results were obtained.

Research Products

• [Journal Article] Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles (2014)
  • Author(s): J. Jansson and A. Lingas
  • Journal Title: Journal of Discrete Algorithms Volume: Vol.25 Pages: 66-78
  • DOI: 10.1016/j.jda.2013.10.002
• [Journal Article] Constructing the R* Consensus Tree of Two Trees in Subcubic Time (2013)
  • Author(s): J. Jansson and W.-K. Sung
  • Journal Title: Algorithmica Volume: Vol.66, Number2 Pages: 329-345
  • DOI: 10.1007/s00453-012-9639-1
• [Journal Article] Faster computation of the Robinson-Foulds distance between phylogenetic networks (2012)
  • Author(s): T. Asano, J. Jansson, K. Sadakane, R. Uehara, and G. Valiente
  • Journal Title: Information Sciences Volume: Vol.197 Pages: 77-90
  • DOI: 10.1016/j.ins.2012.01.038
• [Journal Article] Polynomial-Time Algorithms for Building a Consensus MUL-Tree (2012)
  • Author(s): Y. Cui, J. Jansson, and W.-K. Sung
  • Journal Title: Journal of Computational Biology Volume: Vol.19, Number9 Pages: 1073-1088
  • DOI: 10.1089/cmb.2012.0008
• [Journal Article] Ultra-Succinct Representation of Ordered Trees with Applications (2012)
  • Author(s): J. Jansson, K. Sadakane, and W.-K. Sung
  • Journal Title: Journal of Computer and System Sciences Volume: Vol.78, Number2 Pages: 619-631
  • DOI: 10.1016/j.jcss.2011.09.002
• [Journal Article] The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree (2012)
  • Author(s): J. Jansson, R. S. Lemence, and A. Lingas
  • Journal Title: SIAM Journal on Computing Volume: Vol.41, Number1 Pages: 272-291
  • DOI: 10.1137/100811489
• [Presentation] Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree (2013)
  • Author(s): J. Jansson, C. Shen, and W.-K. Sung
  • Organizer: Proceedings of the Thirteenth International Workshop on Algorithms in Bioinformatics (WABI 2013), Lecture Notes in Computer Science
  • Place of Presentation: Nice, France(Vol.8126, pp.141-155, Springer-Verlag, 2013)
  • Year and Date: 20130902-04
• [Presentation] An Optimal Algorithm for Building the Majority Rule Consensus Tree (2013)
  • Author(s): J. Jansson, C. Shen, and W.-K. Sung
  • Organizer: Proceedings of the Seventeenth Annual International Conference on Research in Computational Molecular Biology (RECOMB 2013), Lecture Notes in Computer Science
  • Place of Presentation: Beijing, China(Vol. 7821, pp. 88-99, Springer-Verlag, 2013)
  • Year and Date: 20130407-10
• [Presentation] Improved Algorithms for Constructing Consensus Trees (2013)
  • Author(s): J. Jansson, C. Shen, and W.-K. Sung
  • Organizer: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), Society for Industrial and Applied Mathematics (SIAM), 2013
  • Place of Presentation: New Orleans, U.S.A.(pp. 1800-1813)
  • Year and Date: 20130106-08
• [Presentation] Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles (2012)
  • Author(s): J. Jansson and A. Lingas
  • Organizer: Proceedings of the Twenty-Third Annual Symposium on Combinatorial Pattern Matching (CPM 2012), Lecture Notes in Computer Science
  • Place of Presentation: Helsinki, Finland(Vol. 7354, pp. 385-398,Springer-Verlag, 2012)
  • Year and Date: 20120703-05
• [Presentation] Upper and Lower Degree Bounde d Graph Orientation with Minimum Penalty (2012)
  • Author(s): Y. Asahiro, J. Jansson, E. Miyano, and H. Ono
  • Organizer: Proceedings of Computing : the Eighteenth Australasian Theory Symposium (CATS 2012), Australian Computer Science Communications
  • Place of Presentation: Melbourne, Australia(Vol.34, Number 8, pp. 139-146, Australian Computer Society Inc., 2012)
  • Year and Date: 20120130-0202
• [Presentation] Algorithms for Building Consensus MUL-trees (2011)
  • Author(s): Y. Cui, J. Jansson, and W.-K. Sung
  • Organizer: Proceedings of the Twenty-Second International Symposium on Algorithms and Computation (ISAAC 2011), Lecture Notes in Computer Science
  • Place of Presentation: Yokohama, Japan(Vol. 7074, pp. 744-753, Springer-Verlag, 2011)
  • Year and Date: 2011-12-05
• [Remarks]
  • URL: http://sunflower.kuicr.kyoto-u.ac.jp/~jj/