Basic Information

Faculty

• 国際高等教育院

Academic Degree

• Ｐｈ．Ｄ．(Lund University)
• Ｍ．Ｓｃ．(Lund University)

ID,URL

• J-Global ID

  201401012105964630

Research

Research Areas

• Informatics, Mathematical informatics

Papers

• Polynomial-time equivalences and refined algorithms for longest common subsequence variants

  Yuichi Asahiro; Jesper Jansson; Guohui Lin; Eiji Miyano; Hirotaka Ono; Tadatoshi Utashima

  Discrete Applied Mathematics, 15 Aug. 2024

  
• A Faster Algorithm for Constructing the Frequency Difference Consensus Tree

  Jesper Jansson; Wing Kin Sung; Seyed Ali Tabatabaee; Yutong Yang

  Leibniz International Proceedings in Informatics, LIPIcs, Mar. 2024

  
• Shortest Longest-Path Graph Orientations

  Yuichi Asahiro; Jesper Jansson; Avraham A. Melkman; Eiji Miyano; Hirotaka Ono; Quan Xue; Shay Zakov

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2024

  
• Normalized L3-based link prediction in protein–protein interaction networks

  Ho Yin Yuen; Jesper Jansson

  BMC Bioinformatics, Dec. 2023

  
• Building a small and informative phylogenetic supertree

  Jesper Jansson; Konstantinos Mampentzidis; T. P. Sandhya

  Information and Computation, Oct. 2023

  
• Online and Approximate Network Construction from Bounded Connectivity Constraints

  Jesper Jansson; Christos Levcopoulos; Andrzej Lingas

  International Journal of Foundations of Computer Science, 01 Aug. 2023

  
• MUL-Tree Pruning for Consistency and Compatibility

  Christopher Hampson; Daniel J. Harvey; Costas S. Iliopoulos; Jesper Jansson; Zara Lim; Wing Kin Sung

  Leibniz International Proceedings in Informatics, LIPIcs, Jun. 2023

  
• Approximation Algorithms for the Longest Run Subsequence Problem

  Yuichi Asahiro; Mingyang Gong; Guohui Lin; Hirotaka Ono; Hiroshi Eto; Jesper Jansson; Eiji Miyano; Shunichi Tanaka

  Leibniz International Proceedings in Informatics, LIPIcs, Jun. 2023

  
• Editorial: Surveys in Algorithm Analysis and Complexity Theory (Special Issue)

  Jesper Jansson

  Algorithms, Apr. 2023

  
• Finding the Cyclic Covers of a String

  Roberto Grossi; Costas S. Iliopoulos; Jesper Jansson; Zara Lim; Wing Kin Sung; Wiktor Zuba

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2023

  
• Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants

  Yuichi Asahiro; Jesper Jansson; Guohui Lin; Eiji Miyano; Hirotaka Ono; Tadatoshi Utashima

  Leibniz International Proceedings in Informatics, LIPIcs, 01 Jun. 2022

  
• Efficient Assignment of Identities in Anonymous Populations

  Leszek Gąsieniec; Jesper Jansson; Christos Levcopoulos; Andrzej Lingas

  Leibniz International Proceedings in Informatics, LIPIcs, 01 Feb. 2022

  
• Upper and lower degree-constrained graph orientation with minimum penalty

  Yuichi Asahiro; Jesper Jansson; Eiji Miyano; Hirotaka Ono

  Theoretical Computer Science, 08 Jan. 2022

  
• New and improved algorithms for unordered tree inclusion

  Tatsuya Akutsu; Jesper Jansson; Ruiming Li; Atsuhiro Takasu; Takeyuki Tamura

  Theoretical Computer Science, 03 Sep. 2021

  
• Foreword: Selected papers from the 22nd International Symposium on Fundamentals of Computation Theory (FCT 2019)

  Leszek Gąsieniec; Jesper Jansson; Christos Levcopoulos

  Journal of Computer and System Sciences, Sep. 2021

  
• Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases

  Leszek Gąsieniec; Jesper Jansson; Christos Levcopoulos; Andrzej Lingas; Mia Persson

  Journal of Computer and System Sciences, Jun. 2021

  
• Computing the Rooted Triplet Distance Between Phylogenetic Networks

  Jesper Jansson; Konstantinos Mampentzidis; Ramesh Rajaby; Wing Kin Sung

  Algorithmica, Jun. 2021

  
• Graph Orientation with Edge Modifications

  Yuichi Asahiro; Jesper Jansson; Eiji Miyano; Hirotaka Ono; T. P. Sandhya

  International Journal of Foundations of Computer Science, Feb. 2021

  
• Online and Approximate Network Construction from Bounded Connectivity Constraints

  Jesper Jansson; Christos Levcopoulos; Andrzej Lingas

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2021

  
• Fast Algorithms for the Rooted Triplet Distance Between Caterpillars

  Jesper Jansson; Wing Lik Lee

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2021

  
• Graph orientation with splits

  Yuichi Asahiro; Jesper Jansson; Eiji Miyano; Hesam Nikpey; Hirotaka Ono

  Theoretical Computer Science, 06 Dec. 2020

  
• Exact algorithms for the repetition-bounded longest common subsequence problem

  Yuichi Asahiro; Jesper Jansson; Guohui Lin; Eiji Miyano; Hirotaka Ono; Tadatoshi Utashima

  Theoretical Computer Science, 24 Oct. 2020

  
• Better Link Prediction for Protein-Protein Interaction Networks

  Ho Yin Yuen; Jesper Jansson

  Proceedings - IEEE 20th International Conference on Bioinformatics and Bioengineering, BIBE 2020, Oct. 2020

  
• An efficient algorithm for the rooted triplet distance between galled trees

  Jesper Jansson; Ramesh Rajaby; Wing Kin Sung

  Journal of Computational Biology, Sep. 2019

  
• Building a small and informative phylogenetic supertree

  Jesper Jansson; Konstantinos Mampentzidis; T. P. Sandhya

  Leibniz International Proceedings in Informatics, LIPIcs, Sep. 2019

  
• Editorial: Special issue on efficient data structures

  Jesper Jansson

  Algorithms, Jul. 2019

  
• The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets

  Katharina Dannenberg; Jesper Jansson; Andrzej Lingas; Eva Marta Lundell

  Discrete Applied Mathematics, 31 Mar. 2019

  
• Graph orientation with edge modifications

  Yuichi Asahiro; Jesper Jansson; Eiji Miyano; Hirotaka Ono; Sandhya T. P

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2019

  
• Computing the rooted triplet distance between phylogenetic networks

  Jesper Jansson; Konstantinos Mampentzidis; Ramesh Rajaby; Wing Kin Sung

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2019

  
• Pushing the online matrix-vector conjecture off-line and identifying its easy cases

  Leszek Gąsieniec; Jesper Jansson; Christos Levcopoulos; Andrzej Lingas; Mia Persson

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2019

  
• Preface

  Leszek Antoni Gąsieniec; Jesper Jansson; Christos Levcopoulos

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2019

  
• Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem

  Yuichi Asahiro; Jesper Jansson; Guohui Lin; Eiji Miyano; Hirotaka Ono; Tadatoshi Utashima

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2019

  
• New and improved algorithms for unordered tree inclusion

  Tatsuya Akutsu; Jesper Jansson; Ruiming Li; Atsuhiro Takasu; Takeyuki Tamura

  Leibniz International Proceedings in Informatics, LIPIcs, 01 Dec. 2018

  
• Determining the consistency of resolved triplets and fan triplets

  Jesper Jansson; Andrzej Lingas; Ramesh Rajaby; Wing Kin Sung

  Journal of Computational Biology, Jul. 2018

  
• Determining the minimum number of protein-protein interactions required to support known protein complexes

  Natsu Nakajima; Morihiro Hayashida; Jesper Jansson; Osamu Maruyama; Tatsuya Akutsu

  PLoS ONE, Apr. 2018

  
• Preface

  Jesper Jansson; Carlos Martín-Vide; Miguel A. Vega-Rodríguez

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2018

  
• Graph Orientation with Splits

  Yuichi Asahiro; Jesper Jansson; Eiji Miyano; Hesam Nikpey; Hirotaka Ono

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2018

  
• 3D Rectangulations and Geometric Matrix Multiplication

  Peter Floderus; Jesper Jansson; Christos Levcopoulos; Andrzej Lingas; Dzmitry Sledneu

  Algorithmica, 01 Jan. 2018

  
• Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree

  Jesper Jansson; Ramesh Rajaby; Chuanqi Shen; Wing Kin Sung

  IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2018

  
• On finding the Adams consensus tree

  Jesper Jansson; Zhaoxian Li; Wing Kin Sung

  Information and Computation, Oct. 2017

  
• A More Practical Algorithm for the Rooted Triplet Distance

  Jesper Jansson; Ramesh Rajaby

  Journal of Computational Biology, Feb. 2017

  
• On the parameterized complexity of associative and commutative unification

  Tatsuya Akutsu; Jesper Jansson; Atsuhiro Takasu; Takeyuki Tamura

  Theoretical Computer Science, 17 Jan. 2017

  Access this paper :

  
• Determining the consistency of resolved triplets and fan triplets

  Jesper Jansson; Andrzej Lingas; Ramesh Rajaby; Wing Kin Sung

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2017

  
• An efficient algorithm for the rooted triplet distance between galled trees

  Jesper Jansson; Ramesh Rajaby; Wing Kin Sung

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2017

  
• Faster Algorithms for Computing the R* Consensus Tree

  Jesper Jansson; Wing Kin Sung; Hoa Vu; Siu Ming Yiu

  Algorithmica, 01 Dec. 2016

  
• Minimal phylogenetic supertrees and local consensus trees

  Jesper Jansson; Wing Kin Sung

  Leibniz International Proceedings in Informatics, LIPIcs, 01 Aug. 2016

  
• Similar subtree search using extended tree inclusion

  Tomoya Mori; Atsuhiro Takasu; Jesper Jansson; Jaewook Hwang; Takeyuki Tamura; Tatsuya Akutsu

  2016 IEEE 32nd International Conference on Data Engineering, ICDE 2016, 22 Jun. 2016

  
• Improved algorithms for constructing consensus trees

  Jesper Jansson; Chuanqi Shen; Wing Kin Sung

  Journal of the ACM, Jun. 2016

  
• Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation

  Yuichi Asahiro; Jesper Jansson; Eiji Miyano; Hirotaka Ono

  Theory of Computing Systems, 01 Jan. 2016

  
• Similar Subtree Search Using Extended Tree Inclusion

  Tomoya Mori; Atsuhiro Takasu; Jesper Jansson; Jaewook Hwang; Takeyuki Tamura; Tatsuya Akutsu

  IEEE Transactions on Knowledge and Data Engineering, 01 Dec. 2015

  
• Graph orientations optimizing the number of light or heavy vertices

  Yuichi Asahiro; Jesper Jansson; Eiji Miyano; Hirotaka Ono

  Journal of Graph Algorithms and Applications, 01 Aug. 2015

  
• Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space

  Jesper Jansson; Kunihiko Sadakane; Wing Kin Sung

  Algorithmica, Apr. 2015

  
• On finding the Adams consensus tree

  Jesper Jansson; Zhaoxian Li; Wing Kin Sung

  Leibniz International Proceedings in Informatics, LIPIcs, 01 Feb. 2015

  
• The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets

  Jesper Jansson; Andrzej Lingas; Eva Marta Lundell

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2015

  
• A more practical algorithm for the rooted triplet distance

  Jesper Jansson; Ramesh Rajaby

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2015

  
• Computing the rooted triplet distance between galled trees by counting triangles

  Jesper Jansson; Andrzej Lingas

  Journal of Discrete Algorithms, Mar. 2014

  
• Degree-constrained graph orientation: Maximum satisfaction and minimum violation

  Yuichi Asahiro; Jesper Jansson; Eiji Miyano; Hirotaka Ono

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014

  
• On the parameterized complexity of associative and commutative unification

  Tatsuya Akutsu; Jesper Jansson; Atsuhiro Takasu; Takeyuki Tamura

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014

  
• 3D rectangulations and geometric matrix multiplication

  Peter Floderus; Jesper Jansson; Christos Levcopoulos; Andrzej Lingas; Dzmitry Sledneu

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014

  
• Faster algorithms for computing the R* Consensus tree

  Jesper Jansson; Wing Kin Sung; Hoa Vu; Siu Ming Yiu

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014

  
• Fast relative Lempel-Ziv self-index for similar sequences

  Huy Hoang Do; Jesper Jansson; Kunihiko Sadakane; Wing Kin Sung

  Theoretical Computer Science, 2014

  
• Approximability of graph orientation problems with degree constraints

  ASAHIRO Yuichi; JANSSON Jesper; MIYANO Eiji; ONO Hirotaka

  IEICE technical report. Theoretical foundations of Computing, 20 Dec. 2013

  
• Constructing the R*consensus tree of two trees in subcubic time

  Jesper Jansson; Wing Kin Sung

  Algorithmica, Jun. 2013

  
• Improved algorithms for constructing consensus trees

  Jesper Jansson; Chuanqi Shen; Wing Kin Sung

  Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

  
• An optimal algorithm for building the majority rule consensus tree

  Jesper Jansson; Chuanqi Shen; Wing Kin Sung

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013

  
• Algorithms for the majority rule (+) consensus tree and the frequency difference consensus tree

  Jesper Jansson; Chuanqi Shen; Wing Kin Sung

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013

  
• Editorial: Special issue on graph algorithms

  Jesper Jansson

  Algorithms, 2013

  
• Improved algorithms for constructing consensus trees

  J. Jansson; C. Shen; W.-K. Sung

  Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2013, Peer-reviewed

  
• Polynomial-time algorithms for building a consensus MUL-tree

  Yun Cui; Jesper Jansson; Wing Kin Sung

  Journal of Computational Biology, 01 Sep. 2012

  
• Faster computation of the Robinson-Foulds distance between phylogenetic networks

  Tetsuo Asano; Jesper Jansson; Kunihiko Sadakane; Ryuhei Uehara; Gabriel Valiente

  Information Sciences, 15 Aug. 2012

  
• More efficient periodic traversal in anonymous undirected graphs

  Jurek Czyzowicz; Stefan Dobrev; Leszek Gasieniec; David Ilcinkas; Jesper Jansson; Ralf Klasing; Ioannis Lignos; Russell Martin; Kunihiko Sadakane; Wing Kin Sung

  Theoretical Computer Science, 27 Jul. 2012

  
• Inferring a graph from path frequency

  Tatsuya Akutsu; Daiji Fukagawa; Jesper Jansson; Kunihiko Sadakane

  Discrete Applied Mathematics, Jul. 2012

  Access this paper :

  
• Ultra-succinct representation of ordered trees with applications

  Jesper Jansson; Kunihiko Sadakane; Wing Kin Sung

  Journal of Computer and System Sciences, Mar. 2012

  
• Upper and lower degree bounded graph orientation with minimum penalty

  Yuichi Asahiro; Jesper Jansson; Eiji Miyano; Hirotaka Ono

  Conferences in Research and Practice in Information Technology Series, 2012

  
• Asymptotic limits of a new type of maximization recurrence with an application to bioinformatics

  Kun Mao Chao; An Chiang Chu; Jesper Jansson; Richard S. Lemence; Alban Mancheron

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012

  
• Fast relative Lempel-Ziv self-index for similar sequences

  Huy Hoang Do; Jesper Jansson; Kunihiko Sadakane; Wing Kin Sung

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012

  
• The complexity of inferring a minimally resolved phylogenetic supertree

  Jesper Jansson; Richard S. Lemence; Andrzej Lingas

  SIAM Journal on Computing, 2012

  
• Computing the rooted triplet distance between galled trees by counting triangles

  Jesper Jansson; Andrzej Lingas

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012

  
• Graph orientations optimizing the number of light or heavy vertices

  Yuichi Asahiro; Jesper Jansson; Eiji Miyano; Hirotaka Ono

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012

  
• CRAM: Compressed Random Access Memory

  Jesper Jansson; Kunihiko Sadakane; Wing Kin Sung

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012

  
• Upper and lower degree bounded graph orientation with minimum penalty

  Y. Asahiro; J. Jansson; E. Miyano; H. Ono

  Conferences in Research and Practice in Information Technology Series, 2012, Peer-reviewed

  
• Minimizing Penalty on Upper and Lower Degree Constrained Graph Orientation

  ASAHIRO Yuichi; JANSSON Jesper; MIYANO Eiji; ONO Hirotaka

  IEICE technical report. Theoretical foundations of Computing, 16 Dec. 2011

  
• Approximation algorithms for buy-at-bulk geometric network design

  Artur Czumaj; Jurek Czyzowicz; Leszek Ga̧sieniec; Jesper Jansson; Andrzej Lingas; Pawel Zylinski

  International Journal of Foundations of Computer Science, Dec. 2011

  
• Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree

  Yuichi Asahiro; Jesper Jansson; Eiji Miyano; Hirotaka Ono; Kouhei Zenmyo

  Journal of Combinatorial Optimization, Jul. 2011

  
• Algorithms for Finding a Most Similar Subforest

  Jesper Jansson; Zeshan Peng

  Theory of Computing Systems, May 2011

  
• Graph orientation to maximize the minimum weighted outdegree

  Yuichi Asahiro; Jesper Jansson; Eiji Miyano; Hirotaka Ono

  International Journal of Foundations of Computer Science, Apr. 2011

  
• Flexible taxonomic assignment of ambiguous sequencing reads

  José C. Clemente; Jesper Jansson; Gabriel Valiente

  BMC Bioinformatics, 07 Jan. 2011

  
• Computing a smallest multilabeled phylogenetic tree from rooted triplets

  Sylvain Guillemot; Jesper Jansson; Wing Kin Sung

  IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2011

  
• Algorithms for building consensus MUL-trees

  Yun Cui; Jesper Jansson; Wing Kin Sung

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2011

  
• New results on optimizing rooted triplets consistency

  Jaroslaw Byrka; Sylvain Guillemot; Jesper Jansson

  Discrete Applied Mathematics, 06 Jun. 2010

  
• Linear-time protein 3-D structure searching with insertions and deletions

  Tetsuo Shibuya; Jesper Jansson; Kunihiko Sadakane

  Algorithms for Molecular Biology, 04 Jan. 2010

  
• Accurate taxonomic assignment of short pyrosequencing reads

  José C. Clemente; Jesper Jansson; Gabriel Valiente

  Pacific Symposium on Biocomputing 2010, PSB 2010, 2010

  
• More efficient periodic traversal in anonymous undirected graphs

  Jurek Czyzowicz; Stefan Dobrev; Leszek Ga̧sieniec; David Ilcinkas; Jesper Jansson; Ralf Klasing; Ioannis Lignos; Russell Martin; Kunihiko Sadakane; Wing Kin Sung

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2010

  
• The complexity of inferring a minimally resolved phylogenetic supertree

  Jesper Jansson; Richard S. Lemence; Andrzej Lingas

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2010

  
• Constructing the R* consensus tree of two trees in subcubic time

  Jesper Jansson; Wing Kin Sung

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2010

  
• Faster computation of the Robinson-Foulds distance between phylogenetic networks

  Tetsuo Asano; Jesper Jansson; Kunihiko Sadakane; Ryuhei Uehara; Gabriel Valiente

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2010

  
• ACCURATE TAXONOMIC ASSIGNMENT OF SHORT PYROSEQUENCING READS

  Jose C. Clemente; Jesper Jansson; Gabriel Valiente

  PACIFIC SYMPOSIUM ON BIOCOMPUTING 2010, 2010, Peer-reviewed

  
• Graph Orientation to Maximize the Minimum Weighted Outdegree

  Yuichi Asahiro; Jesper Jansson; Eiji Miyano; Hirotaka Ono

  2009 IEEE INTERNATIONAL SYMPOSIUM ON PARALLEL & DISTRIBUTED PROCESSING, VOLS 1-5, 2009, Peer-reviewed

  
• Linear-time protein 3-D structure searching with insertions and deletions

  Tetsuo Shibuya; Jesper Jansson; Kunihiko Sadakane

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2009

  
• Approximation algorithms for buy-at-bulk geometric network design

  Artur Czumaj; Jurek Czyzowicz; Leszek Ga̧sieniec; Jesper Jansson; Andrzej Lingas; Pawel Zylinski

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2009

  
• Computing a smallest multi-labeled phylogenetic tree from rooted triplets

  Sylvain Guillemot; Jesper Jansson; Wing Kin Sung

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2009

  
• New results on optimizing rooted triplets consistency

  Jaroslaw Byrka; Sylvain Guillemot; Jesper Jansson

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2008

  
• Polynomial-time algorithms for the ordered maximum agreement subtree problem

  Anders Dessmark; Jesper Jansson; Andrzej Lingas; Eva Marta Lundell

  Algorithmica (New York), Jul. 2007

  
• Online and dynamic recognition of squarefree strings

  Jesper Jansson; Zeshan Peng

  International Journal of Foundations of Computer Science, Apr. 2007

  
• On the approximability of maximum and minimum edge clique partition problems

  Anders Dessmark; Andrzej Lingas; Eva Marta Lundell; Mia Persson; Jesper Jansson

  International Journal of Foundations of Computer Science, Apr. 2007

  
• Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree

  Yuichi Asahiro; Jesper Jansson; Eiji Miyano; Hirotaka Ono; Kouhei Zenmyo

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2007

  
• Compressed dynamic tries with applications to LZ-compression in sublinear time and space

  Jesper Jansson; Kunihiko Sadakane; Wing Kin Sung

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2007

  
• Ultra-succinct representation of ordered trees

  Jesper Jansson; Kunihiko Sadakane; Wing Kin Sung

  Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

  
• Inferring a level-1 phylogenetic network from a dense set of rooted triplets

  Jesper Jansson; Wing Kin Sung

  Theoretical Computer Science, 25 Oct. 2006

  
• A faster and more space-efficient algorithm for inferring arc-annotations of RNA sequences through alignment

  Jesper Jansson; See Kiong Ng; Wing Kin Sung; Hugo Willy

  Algorithmica (New York), Oct. 2006

  
• Reconstructing an ultrametric galled phylogenetic network from a distance matrix

  Ho Leung Chan; Jesper Jansson; Tak Wah Lam; Siu Ming Yiu

  Journal of Bioinformatics and Computational Biology, Aug. 2006

  
• (In)approximability of Graph Orientation to Minimize the Maximum Weighted Outdegree

  ASAHIRO Yuichi; JANSSON Jesper; MIYANO Eiji; ONO Hirotaka; ZENMYO Kohei

  IPSJ SIG Notes, 03 Jul. 2006

  
• Local gapped subforest alignment and its application in finding RNA structural motifs

  Jesper Jansson; Ngo Trung Hieu; Wing Kin Sung

  Journal of Computational Biology, Apr. 2006

  
• Algorithms for finding a most similar subforest

  Jesper Jansson; Zeshan Peng

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2006

  
• Inferring phylogenetic relationships avoiding forbidding rooted triplets

  Ying Jun He; Trinh N.D. Huynh; Jesper Jansson; Wing Kin Sung

  Journal of Bioinformatics and Computational Biology, 2006

  
• Algorithms for combining rooted triplets into a galled phylogenetic network

  Jesper Jansson; Nguyen Bao Nguyen; Wing Kin Sung

  SIAM Journal on Computing, 2006

  
• On the approximability of maximum and minimum edge clique partition problems

  Anders Dessmark; Jesper Jansson; Andrzej Lingas; Eva Marta Lundell; Mia Persson

  Conferences in Research and Practice in Information Technology Series, 2006

  
• Rooted maximum agreement supertrees

  Jesper Jansson; Joseph H.K. Ng; Kunihiko Sadakane; Wing Kin Sung

  Algorithmica (New York), Dec. 2005

  
• Computing the maximum agreement of phylogenetic networks

  Charles Choy; Jesper Jansson; Kunihiko Sadakane; Wing Kin Sung

  Theoretical Computer Science, 20 May 2005

  
• Algorithms for combining rooted triplets into a galled phylogenetic network

  Jesper Jansson; Nguyen Bao Nguyen; Wing Kin Sung

  Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

  
• Finding short right-hand-on-the-wall walks in graphs

  Stefan Dobrev; Jesper Jansson; Kunihiko Sadakane; Wing Kin Sung

  Lecture Notes in Computer Science, 2005

  
• Constructing a smallest refining galled phylogenetic network

  Trinh N.D. Huynh; Jesper Jansson; Nguyen Bao Nguyen; Wing Kin Sung

  Lecture Notes in Bioinformatics (Subseries of Lecture Notes in Computer Science), 2005

  
• Reconstructing an ultrametric galled phylogenetic network from a distance matrix

  Ho Leung Chan; Jesper Jansson; Tak Wah Lam; Siu Ming Yiu

  Lecture Notes in Computer Science, 2005

  
• Online and dynamic recognition of squarefree strings

  Jesper Jansson; Zeshan Peng

  Lecture Notes in Computer Science, 2005

  
• Inferring phylogenetic relationships avoiding Forbidden rooted triplets

  Ying Jun He; Trinh N.D. Huynh; Jesper Jansson; Wing Kin Sung

  Series on Advances in Bioinformatics and Computational Biology, 2005

  
• Approximation algorithms for Hamming clustering problems

  Leszek Ga̧sieniec; Jesper Jansson; Andrzej Lingas

  Journal of Discrete Algorithms, Jun. 2004

  
• Computing the maximum agreement of phylogenetic networks

  Charles Choy; Jesper Jansson; Kunihiko Sadakane; Wing Kin Sung

  Electronic Notes in Theoretical Computer Science, 16 Feb. 2004

  
• Inferring a level-1 phylogenetic network from a dense set of rooted triplets

  Jesper Jansson; Wing Kin Sung

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2004

  
• Rooted maximum agreement supertrees

  Jesper Jansson; Joseph H.K. Ng; Kunihiko Sadakane; Wing Kin Sung

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2004

  
• Local gapped subforest alignment and its application in finding RNA structural motifs

  Jesper Jansson; Ngo Trung Hieu; Wing Kin Sung

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2004

  
• The maximum agreement of two nested phylogenetic networks

  Jesper Jansson; Wing Kin Sung

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2004

  
• A faster and more space-efficient algorithm for inferring Arc-annotations of RNA sequences through alignment

  Jesper Jansson; See Kiong Ng; Wing Kin Sung; Hugo Willy

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2004

  
• Polynomial-time algorithms for the ordered maximum agreement subtree problem

  Anders Dessmark; Jesper Jansson; Andrzej Lingas; Eva Marta Lundell

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2004

  
• Semi-balanced colorings of graphs: Generalized 2-colorings based on a relaxed discrepancy condition

  Jesper Jansson; Takeshi Tokuyama

  Graphs and Combinatorics, 2004

  
• A Fast Algorithm for Optimal Alignment between Similar Ordered Trees

  Jesper Jansson; Andrzej Lingas

  Fundamenta Informaticae, Jul. 2003

  
• Semi-Balanced Colorings of Graphs : 2-Colorings Based on a Relaxed Discrepancy Condition

  JANSSON Jesper; TOKUYAMA Takeshi

  IPSJ SIG Notes, 25 Jul. 2002

  
• On the complexity of inferring rooted evolutionary trees

  Jesper Jansson

  Electronic Notes in Discrete Mathematics, Apr. 2001

  
• A fast algorithm for optimal alignment between similar ordered trees

  Jesper Jansson; Andrzej Lingas

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2001

  
• Approximation algorithms for hamming clustering problems

  Leszek G Ą Sieniec; Jesper Jansson; Andrzej Lingas

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2000

  
• Efficient approximation algorithms for the Hamming center problem

  Leszek Gasieniec; Jesper Jansson; Andrzej Lingas

  Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

  
• On the Complexity of Constructing Evolutionary Trees

  Leszek Ga̧sieniec; Jesper Jansson; Andrzej Lingas; Anna Östlin

  Journal of Combinatorial Optimization, 1999

  
• Efficient approximation algorithms for the Hamming center problem

  Leszek Gasieniec; Jesper Jansson; Andrzej Lingas

  Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 1999, Peer-reviewed

  
• On the complexity of computing evolutionary trees

  Leszek Gasieniec; Jesper Jansson; Andrzej Lingas; Anna Östlin

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1997

  

Awards

• 28 Oct. 2020

  Institute of Electrical and Electronics Engineers (IEEE), Best Paper Award in Bioinformatics at The Twentieth IEEE International Conference on BioInformatics and BioEngineering (IEEE BIBE 2020)

  "Better Link Prediction for Protein-Protein Interaction Networks", United States, International academic award

  Ho Yin Yuen, Jesper Jansson

External funds: Kakenhi

• Phylogenetic Network Simplification

  Grant-in-Aid for Scientific Research (B)

  Basic Section 60010:Theory of informatics-related

  Kyoto University

  ジャンソン ジェスパー

  From 01 Apr. 2022, To 31 Mar. 2025, Granted

  algorithm;computational complexity;phylogenetic network;distance functions;structural parameters;MUL-tree;pruning;phylogenetics

  https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-23K24807/
• Phylogenetic Network Simplification

  Grant-in-Aid for Scientific Research (B)

  Basic Section 60010:Theory of informatics-related

  Kyoto University

  ジャンソン ジェスパー

  From 01 Apr. 2022, To 31 Mar. 2025, Granted

  algorithm;computational complexity;phylogenetic network;distance functions;structural parameters;MUL-tree;pruning;phylogenetics

  https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-22H03550/
• Fast Graph Algorithms for Phylogenetics

  Grant-in-Aid for Scientific Research (C)

  Kyoto University

  Jesper Jansson

  From 01 Apr. 2014, To 31 Mar. 2018, Project Closed

  Algorithm theory;Computational complexity;Implementations;Graph algorithms;Phylogenetic tree;Consensus tree;Supertree;algorithm;computational complexity;phylogenetic tree;consensus tree

  https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-26330014/
• Comparing and Combining Trees

  Grant-in-Aid for Young Scientists (B)

  Kyoto University;Ochanomizu University

  Jesper JANSSON

  From 01 Apr. 2011, To 31 Mar. 2014, Project Closed

  アルゴリズム;計算複雑さ;系統樹;algorithm;computational complexity;phylogenetic tree;consensus tree;rooted triplet distance;計算複雑性;順序木;超系統樹;合意樹;類似度

  https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-23700011/
• Matrix multiplication via 3D partitioning

  Grant-in-Aid for Challenging Research (Exploratory)

  Medium-sized Section 60:Information science, computer engineering, and related fields

  Kyoto University

  ジャンソン ジェスパー

  From 28 Jun. 2024, To 31 Mar. 2027, Adopted

  https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-24K22294/
• Matrix multiplication via 3D partitioning

  Grant-in-Aid for Challenging Research (Exploratory)

  Medium-sized Section 60:Information science, computer engineering, and related fields

  Kyoto University

  ジャンソン ジェスパー

  From 28 Jun. 2024, To 31 Mar. 2027, Granted

  algorithm;time complexity;matrix multiplication;histogram;partitioning

  https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-24K22294/

Education

Teaching subject(s)

• From 01 Apr. 2021, To 31 Mar. 2022

  Introduction to Formal Languages-E2

  T065, Spring, Institute for Liberal Arts and Sciences
• From 01 Apr. 2021, To 31 Mar. 2022

  Introduction to Formal Languages-E2

  T065, Fall, Institute for Liberal Arts and Sciences
• From 01 Apr. 2022, To 31 Mar. 2023

  Introduction to Formal Languages-E2

  T065, Spring, Institute for Liberal Arts and Sciences, 2
• From 01 Apr. 2022, To 31 Mar. 2023

  Introduction to Formal Languages-E2

  T065, Fall, Institute for Liberal Arts and Sciences, 2
• From 01 Apr. 2023, To 31 Mar. 2024

  Introduction to Formal Languages-E2

  T065, Spring, Institute for Liberal Arts and Sciences, 2
• From 01 Apr. 2023, To 31 Mar. 2024

  Introduction to Formal Languages-E2

  T065, Fall, Institute for Liberal Arts and Sciences, 2
• From 01 Apr. 2024, To 31 Mar. 2025

  Introduction to Formal Languages-E2

  T065, Spring, Institute for Liberal Arts and Sciences, 2
• From 01 Apr. 2024, To 31 Mar. 2025

  Introduction to Formal Languages-E2

  T065, Fall, Institute for Liberal Arts and Sciences, 2
• From 01 Apr. 2021, To 31 Mar. 2022

  Introduction to Algorithms-E2

  T052, Spring, Institute for Liberal Arts and Sciences
• From 01 Apr. 2021, To 31 Mar. 2022

  Introduction to Algorithms-E2

  T052, Fall, Institute for Liberal Arts and Sciences
• From 01 Apr. 2022, To 31 Mar. 2023

  Introduction to Algorithms-E2

  T052, Spring, Institute for Liberal Arts and Sciences, 2
• From 01 Apr. 2022, To 31 Mar. 2023

  Introduction to Algorithms-E2

  T052, Fall, Institute for Liberal Arts and Sciences, 2
• From 01 Apr. 2023, To 31 Mar. 2024

  Introduction to Algorithms-E2

  T052, Spring, Institute for Liberal Arts and Sciences, 2
• From 01 Apr. 2023, To 31 Mar. 2024

  Introduction to Algorithms-E2

  T052, Fall, Institute for Liberal Arts and Sciences, 2
• From 01 Apr. 2024, To 31 Mar. 2025

  Introduction to Algorithms-E2

  T052, Spring, Institute for Liberal Arts and Sciences, 2
• From 01 Apr. 2024, To 31 Mar. 2025

  Introduction to Algorithms-E2

  T052, Fall, Institute for Liberal Arts and Sciences, 2
• From 01 Apr. 2021, To 31 Mar. 2022

  Introduction to Algorithms and Informatics

  M307, Spring, Institute for Liberal Arts and Sciences
• From 01 Apr. 2022, To 31 Mar. 2023

  Introduction to Algorithms and Informatics

  M307, Spring, Institute for Liberal Arts and Sciences, 2
• From 01 Apr. 2023, To 31 Mar. 2024

  Introduction to Algorithms and Informatics

  M307, Spring, Institute for Liberal Arts and Sciences, 2
• From 01 Apr. 2024, To 31 Mar. 2025

  Introduction to Algorithms and Informatics

  M307, Spring, Institute for Liberal Arts and Sciences, 2
• From 01 Apr. 2021, To 31 Mar. 2022

  Introduction to Algorithms and Informatics

  3618, Spring, Graduate School of Informatics, 2
• From 01 Apr. 2022, To 31 Mar. 2023

  Introduction to Algorithms and Informatics

  3618, Spring, Graduate School of Informatics, 2
• From 01 Apr. 2023, To 31 Mar. 2024

  Introduction to Algorithms and Informatics

  3618, Spring, Graduate School of Informatics, 2
• From 01 Apr. 2024, To 31 Mar. 2025

  Introduction to Algorithms and Informatics

  3618, Spring, Graduate School of Informatics, 2
• From 01 Apr. 2021, To 31 Mar. 2022

  Theory of Computational Complexity

  3614, Fall, Graduate School of Informatics, 2
• From 01 Apr. 2022, To 31 Mar. 2023

  Theory of Computational Complexity

  3614, Fall, Graduate School of Informatics, 2
• From 01 Apr. 2023, To 31 Mar. 2024

  Theory of Computational Complexity

  3614, Fall, Graduate School of Informatics, 2
• From 01 Apr. 2024, To 31 Mar. 2025

  Theory of Computational Complexity

  3614, Fall, Graduate School of Informatics, 2
• From 01 Apr. 2021, To 31 Mar. 2022

  Perspective in Informatics 5

  8045, Fall, Graduate School of Informatics, 2
• From 01 Apr. 2022, To 31 Mar. 2023

  Perspective in Informatics 5

  8045, Fall, Graduate School of Informatics, 2
• From 01 Apr. 2023, To 31 Mar. 2024

  Perspective in Informatics 5

  8045, Fall, Graduate School of Informatics, 2
• From 01 Apr. 2024, To 31 Mar. 2025

  Perspective in Informatics 5

  8045, Fall, Graduate School of Informatics, 2

Participation in PhD Defenses (other than KU)

• On Phylogenetic Encodings and Orchard Networks

  Yukihiro Murakami, TU Delft, The Netherlands, Sub-chief Examiner

  29 Nov. 2021
• Dynamic and Probabilistic Models in Optimization: Algorithms for Combinatorial Problems with Applications in Machine Learning

  Bo Wang, The University of Hong Kong (HKU), China, Sub-chief Examiner

  10 Jan. 2024