• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Jansson Jesper  ジャンソン ジェスパー

ORCIDConnect your ORCID iD *help
… Alternative Names

JANSSON Jesper  ジャンソン ジェスパー

Less
Researcher Number 60536100
Other IDs
Affiliation (Current) 2025: 京都大学, 情報学研究科, 特定准教授
Affiliation (based on the past Project Information) *help 2022 – 2024: 京都大学, 情報学研究科, 特定准教授
2016 – 2017: 京都大学, 白眉センター, 特定准教授
2012 – 2015: 京都大学, 白眉センター, 准教授
2013: 京都大学, 白眉センター, 特定准教授
2011: お茶の水女子大学, お茶大アカデミック・プロダクション, 助教
Review Section/Research Field
Principal Investigator
Medium-sized Section 60:Information science, computer engineering, and related fields / Basic Section 60010:Theory of informatics-related / Theory of informatics / Fundamental theory of informatics
Keywords
Principal Investigator
algorithm / computational complexity / consensus tree / phylogenetic tree / partitioning / histogram / matrix multiplication / time complexity / phylogenetics / pruning … More / MUL-tree / structural parameters / distance functions / phylogenetic network / Supertree / Consensus tree / Phylogenetic tree / Graph algorithms / Implementations / Computational complexity / Algorithm theory / 類似度 / 合意樹 / 超系統樹 / 順序木 / 計算複雑性 / rooted triplet distance / 系統樹 / 計算複雑さ / アルゴリズム Less
  • Research Projects

    (4 results)
  • Research Products

    (50 results)
  • Co-Researchers

    (2 People)
  •  Matrix multiplication via 3D partitioningPrincipal Investigator

    • Principal Investigator
      ジャンソン ジェスパー
    • Project Period (FY)
      2024 – 2026
    • Research Category
      Grant-in-Aid for Challenging Research (Exploratory)
    • Review Section
      Medium-sized Section 60:Information science, computer engineering, and related fields
    • Research Institution
      Kyoto University
  •  Phylogenetic Network SimplificationPrincipal Investigator

    • Principal Investigator
      ジャンソン ジェスパー
    • Project Period (FY)
      2022 – 2024
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Review Section
      Basic Section 60010:Theory of informatics-related
    • Research Institution
      Kyoto University
  •  Fast Graph Algorithms for PhylogeneticsPrincipal Investigator

    • Principal Investigator
      Jansson Jesper
    • Project Period (FY)
      2014 – 2017
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Theory of informatics
    • Research Institution
      Kyoto University
  •  Comparing and Combining TreesPrincipal Investigator

    • Principal Investigator
      JANSSON Jesper
    • Project Period (FY)
      2011 – 2013
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Kyoto University
      Ochanomizu University

All 2023 2018 2017 2016 2015 2014 2013 2012 2011 Other

All Journal Article Presentation Book

  • [Book] Phylogenetic Tree Construction from a Distance Matrix [chapter in Encyclopedia of Algorithms]2016

    • Author(s)
      J. Jansson
    • Publisher
      Springer Science+Business Media New York
    • Data Source
      KAKENHI-PROJECT-26330014
  • [Book] Directed Perfect Phylogeny (Binary Characters) [chapter in Encyclopedia of Algorithms]2016

    • Author(s)
      J. Jansson
    • Publisher
      Springer Science+Business Media New York
    • Data Source
      KAKENHI-PROJECT-26330014
  • [Book] Perfect Phylogeny (Bounded Number of States) [chapter in Encyclopedia of Algorithms]2016

    • Author(s)
      J. Jansson
    • Publisher
      Springer Science+Business Media New York
    • Data Source
      KAKENHI-PROJECT-26330014
  • [Book] Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network [chapter in Encyclopedia of Algorithms]2016

    • Author(s)
      J. Jansson and W.-K. Sung
    • Publisher
      Springer Science+Business Media New York
    • Data Source
      KAKENHI-PROJECT-26330014
  • [Book] Maximum Agreement Supertree [chapter in Encyclopedia of Algorithms]2016

    • Author(s)
      J. Jansson and W.-K. Sung
    • Publisher
      Springer Science+Business Media New York
    • Data Source
      KAKENHI-PROJECT-26330014
  • [Journal Article] Approximation Algorithms for the Longest Run Subsequence Problem2023

    • Author(s)
      Y. Asahiro, H. Eto, M. Gong, J. Jansson, G. Lin, E. Miyano, H. Ono, S. Tanaka
    • Journal Title

      LIPIcs, CPM 2023

      Volume: To appear

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-23K24807
  • [Journal Article] MUL-Tree Pruning for Consistency and Compatibility2023

    • Author(s)
      C. Hampson, D. J. Harvey, C. Iliopoulos, J. Jansson, Z. Lim, W.-K. Sung
    • Journal Title

      LIPIcs, CPM 2023

      Volume: To appear

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-23K24807
  • [Journal Article] Determining the Consistency of Resolved Triplets and Fan Triplets2018

    • Author(s)
      J. Jansson, A. Lingas, R. Rajaby, and W.-K. Sung
    • Journal Title

      Journal of Computational Biology

      Volume: 25 Issue: 7 Pages: 740-754

    • DOI

      10.1089/cmb.2017.0256

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330014
  • [Journal Article] Minimal Phylogenetic Supertrees and Local Consensus Trees2018

    • Author(s)
      J. Jansson, R. Rajaby, and W.-K. Sung
    • Journal Title

      AIMS Medical Science

      Volume: 5 Issue: 2 Pages: 181-203

    • DOI

      10.3934/medsci.2018.2.181

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330014
  • [Journal Article] Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree2018

    • Author(s)
      J. Jansson, R. Rajaby, C. Shen, and W.-K. Sung
    • Journal Title

      IEEE/ACM Transactions on Computational Biology and Bioinformatics

      Volume: 15(1) Issue: 1 Pages: 15-26

    • DOI

      10.1109/tcbb.2016.2609923

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330014
  • [Journal Article] An Efficient Algorithm for the Rooted Triplet Distance between Galled Trees2017

    • Author(s)
      J. Jansson, R. Rajaby, and W.-K. Sung
    • Journal Title

      Lecture Notes in Computer Science (AlCoB 2017)

      Volume: 10252 Pages: 115-126

    • DOI

      10.1007/978-3-319-58163-7_8

    • ISBN
      9783319581620, 9783319581637
    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330014
  • [Journal Article] On Finding the Adams Consensus Tree2017

    • Author(s)
      J. Jansson, Z. Li, and W.-K. Sung
    • Journal Title

      Information and Computation

      Volume: 256 Pages: 334-347

    • DOI

      10.1016/j.ic.2017.08.002

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330014
  • [Journal Article] Determining the Consistency of Resolved Triplets and Fan Triplets2017

    • Author(s)
      J. Jansson, A. Lingas, R. Rajaby, and W.-K. Sung
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 10229 Pages: 1-17

    • Peer Reviewed / Acknowledgement Compliant / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330014
  • [Journal Article] Faster Algorithms for Computing the R* Consensus Tree2016

    • Author(s)
      J. Jansson, W.-K. Sung, H. Vu, and S.-M. Yiu
    • Journal Title

      Algorithmica

      Volume: 76 Issue: 4 Pages: 1224-1244

    • DOI

      10.1007/s00453-016-0122-2

    • Peer Reviewed / Acknowledgement Compliant / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330014
  • [Journal Article] Improved Algorithms for Constructing Consensus Trees2016

    • Author(s)
      J. Jansson, C. Shen, and W.-K. Sung
    • Journal Title

      Journal of the ACM

      Volume: 63 Issue: 3 Pages: 28-28

    • DOI

      10.1145/2925985

    • Peer Reviewed / Acknowledgement Compliant / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330014
  • [Journal Article] Minimal Phylogenetic Supertrees and Local Consensus Trees2016

    • Author(s)
      J. Jansson and W.-K. Sung
    • Journal Title

      LIPIcs

      Volume: 58

    • DOI

      10.4230/LIPIcs.MFCS.2016.53

    • Peer Reviewed / Acknowledgement Compliant / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330014
  • [Journal Article] A More Practical Algorithm for the Rooted Triplet Distance2016

    • Author(s)
      J. Jansson and R. Rajaby
    • Journal Title

      Journal of Computational Biology

      Volume: 24 Issue: 2 Pages: 106-126

    • DOI

      10.1089/cmb.2016.0185

    • Peer Reviewed / Acknowledgement Compliant / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330014
  • [Journal Article] The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets2015

    • Author(s)
      J. Jansson, A. Lingas, and E.-M. Lundell
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 9133 Pages: 272-283

    • DOI

      10.1007/978-3-319-19929-0_23

    • ISBN
      9783319199283, 9783319199290
    • Peer Reviewed / Acknowledgement Compliant / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330014
  • [Journal Article] A More Practical Algorithm for the Rooted Triplet Distance2015

    • Author(s)
      J. Jansson and R. Rajaby
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 9199 Pages: 109-125

    • DOI

      10.1007/978-3-319-21233-3_9

    • ISBN
      9783319212326, 9783319212333
    • Peer Reviewed / Acknowledgement Compliant / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330014
  • [Journal Article] On Finding the Adams Consensus Tree2015

    • Author(s)
      J. Jansson, Z. Li, and W.-K. Sung
    • Journal Title

      LIPIcs

      Volume: 30 Pages: 487-499

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-26330014
  • [Journal Article] Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles2014

    • 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

    • Data Source
      KAKENHI-PROJECT-23700011
  • [Journal Article] Faster Algorithms for Computing the R* Consensus Tree2014

    • Author(s)
      J. Jansson, W.-K. Sung, H. Vu, and S.-M. Yiu
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 8889 Pages: 414-425

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-26330014
  • [Journal Article] Improved Algorithms for Constructing Consensus Trees.2013

    • Author(s)
      J. Jansson, C. Shen, and W.-K. Sung.
    • Journal Title

      Proc. of SODA 2013

      Volume: 2013 Pages: 1800-1813

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23700011
  • [Journal Article] Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree2013

    • Author(s)
      J. Jansson, C. Shen, and W.-K. Sung
    • Journal Title

      Lecture Notes in Computer Science (WABI 2013)

      Volume: 8126 Pages: 141-155

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23700011
  • [Journal Article] An Optimal Algorithm for Building the Majority Rule Consensus Tree2013

    • Author(s)
      J. Jansson, C. Shen, and W.-K. Sung
    • Journal Title

      Lecture Notes in Computer Science (RECOMB 2013)

      Volume: 7821 Pages: 88-99

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23700011
  • [Journal Article] Constructing the R* Consensus Tree of Two Trees in Subcubic Time2013

    • Author(s)
      J. Jansson and W.-K. Sung
    • Journal Title

      Algorithmica

      Volume: Vol.66, Number2 Issue: 2 Pages: 329-345

    • DOI

      10.1007/s00453-012-9639-1

    • Data Source
      KAKENHI-PROJECT-23700011
  • [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: 197 Pages: 77-90

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23700011
  • [Journal Article] The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree2012

    • Author(s)
      J. Jansson, R. S. Lemence, and A. Lingas
    • Journal Title

      SIAM Journal on Computing

      Volume: Vol.41, Number1 Issue: 1 Pages: 272-291

    • DOI

      10.1137/100811489

    • Data Source
      KAKENHI-PROJECT-23700011
  • [Journal Article] Ultra-succinct representation of ordered trees with applications2012

    • Author(s)
      Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
    • Journal Title

      Journal of Computer and System Sciences

      Volume: 78(2) Issue: 2 Pages: 619-631

    • DOI

      10.1016/j.jcss.2011.09.002

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21220001, KAKENHI-PROJECT-23240002, KAKENHI-PROJECT-23700011
  • [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: 19 Pages: 1073-1088

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23700011
  • [Journal Article] Polynomial-Time Algorithms for Building a Consensus MUL-Tree2012

    • Author(s)
      Y. Cui, J. Jansson, and W.-K. Sung
    • Journal Title

      Journal of Computational Biology

      Volume: Vol.19, Number9 Issue: 9 Pages: 1073-1088

    • DOI

      10.1089/cmb.2012.0008

    • Data Source
      KAKENHI-PROJECT-23700011
  • [Journal Article] Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty2012

    • Author(s)
      Y. Asahiro, J. Jansson, E. Miyano, H. Ono
    • Journal Title

      Australian Computer Science Communications

      Volume: 34

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23700011
  • [Journal Article] Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks2012

    • Author(s)
      Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente
    • Journal Title

      Information Sciences

      Volume: 197 Pages: 77-90

    • DOI

      10.1016/j.ins.2012.01.038

    • NAID

      120003184350

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23240002, KAKENHI-PROJECT-23300001, KAKENHI-PROJECT-23500013, KAKENHI-PROJECT-23700011, KAKENHI-PLANNED-24106004
  • [Journal Article] Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles.2012

    • Author(s)
      J. Jansson and A. Lingas.
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 7354 Pages: 385-398

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23700011
  • [Journal Article] Algorithms for Building Consensus MUL-trees2011

    • Author(s)
      Y. Cui, J. Jansson, W.-K. Sung
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 7074 Pages: 744-753

    • DOI

      10.1007/978-3-642-25591-5_76

    • ISBN
      9783642255908, 9783642255915
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23700011
  • [Presentation] MUL-Tree Pruning for Consistency and Compatibility2023

    • Author(s)
      J. Jansson
    • Organizer
      CPM 2023 (34th Annual Symposium on Combinatorial Pattern Matching)
    • Data Source
      KAKENHI-PROJECT-23K24807
  • [Presentation] Minimal Phylogenetic Supertrees and Local Consensus Trees2016

    • Author(s)
      Jesper Jansson
    • Organizer
      MFCS 2016
    • Place of Presentation
      Krakow, Poland
    • Year and Date
      2016-08-22
    • Data Source
      KAKENHI-PROJECT-26330014
  • [Presentation] A More Practical Algorithm for the Rooted Triplet Distance2015

    • Author(s)
      Jesper Jansson
    • Organizer
      AlCoB 2015
    • Place of Presentation
      Mexico City, Mexico
    • Year and Date
      2015-08-04
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330014
  • [Presentation] The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets2015

    • Author(s)
      Jesper Jansson
    • Organizer
      CPM 2015
    • Place of Presentation
      Ischia Island, Italy
    • Year and Date
      2015-06-30
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330014
  • [Presentation] On Finding the Adams Consensus Tree2015

    • Author(s)
      Jesper Jansson
    • Organizer
      STACS 2015
    • Place of Presentation
      Munich, Germany
    • Year and Date
      2015-03-05
    • Data Source
      KAKENHI-PROJECT-26330014
  • [Presentation] Comparing Phylogenetic Networks by Counting Triangles2015

    • Author(s)
      Jesper Jansson
    • Organizer
      NUS workshop (not refereed)
    • Place of Presentation
      Singapore
    • Year and Date
      2015-07-27
    • Invited
    • Data Source
      KAKENHI-PROJECT-26330014
  • [Presentation] Faster Algorithms for Computing the R* Consensus Tree2014

    • Author(s)
      Jesper Jansson
    • Organizer
      ISAAC 2014
    • Place of Presentation
      Jeonju, South Korea
    • Year and Date
      2014-12-16
    • Data Source
      KAKENHI-PROJECT-26330014
  • [Presentation] Improved Algorithms for Constructing Consensus Trees2013

    • 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)
    • Data Source
      KAKENHI-PROJECT-23700011
  • [Presentation] Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree2013

    • 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)
    • Data Source
      KAKENHI-PROJECT-23700011
  • [Presentation] An Optimal Algorithm for Building the Majority Rule Consensus Tree2013

    • 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)
    • Data Source
      KAKENHI-PROJECT-23700011
  • [Presentation] Upper and Lower Degree Bounde d Graph Orientation with Minimum Penalty2012

    • 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)
    • Data Source
      KAKENHI-PROJECT-23700011
  • [Presentation] Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles2012

    • 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)
    • Data Source
      KAKENHI-PROJECT-23700011
  • [Presentation] Algorithms for Building Consensus MUL-trees2011

    • Author(s)
      Jesper Jansson
    • Organizer
      The Twenty-Second International Symposium on Algorithms and Computation (ISAAC 2011)
    • Place of Presentation
      横浜
    • Data Source
      KAKENHI-PROJECT-23700011
  • [Presentation] Algorithms for Building Consensus MUL-trees2011

    • 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
    • Data Source
      KAKENHI-PROJECT-23700011
  • [Presentation] Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree

    • Author(s)
      J. Jansson
    • Organizer
      Thirteenth International Workshop on Algorithms in Bioinformatics (WABI 2013)
    • Place of Presentation
      Nice, France
    • Data Source
      KAKENHI-PROJECT-23700011
  • 1.  定兼 邦彦
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 2 results
  • 2.  浅野 哲夫
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results

URL: 

Are you sure that you want to link your ORCID iD to your KAKEN Researcher profile?
* This action can be performed only by the researcher himself/herself who is listed on the KAKEN Researcher’s page. Are you sure that this KAKEN Researcher’s page is your page?

この研究者とORCID iDの連携を行いますか?
※ この処理は、研究者本人だけが実行できます。

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi