教育研究活動データベース

日本語に切り替えるswitch to english

jansson jesper

ジャンソン ジェスパー

情報学研究科 情報学専攻コンピュータ工学講座 特定准教授

jansson jesper
list
    Last Updated :2025/05/02

    基本情報

    学部兼担

    • 国際高等教育院

    学位

    • Ph.D.(Lund University)
    • M.Sc.(Lund University)

    ID,URL

    list
      Last Updated :2025/05/02

      研究

      研究分野

      • 情報通信, 数理情報学

      論文

      • 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, 2024年08月15日
      • 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, 2024年03月
      • 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, 2023年12月
      • Building a small and informative phylogenetic supertree
        Jesper Jansson; Konstantinos Mampentzidis; T. P. Sandhya
        Information and Computation, 2023年10月
      • Online and Approximate Network Construction from Bounded Connectivity Constraints
        Jesper Jansson; Christos Levcopoulos; Andrzej Lingas
        International Journal of Foundations of Computer Science, 2023年08月01日
      • 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, 2023年06月
      • 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, 2023年06月
      • Editorial: Surveys in Algorithm Analysis and Complexity Theory (Special Issue)
        Jesper Jansson
        Algorithms, 2023年04月
      • 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, 2022年06月01日
      • Efficient Assignment of Identities in Anonymous Populations
        Leszek Gąsieniec; Jesper Jansson; Christos Levcopoulos; Andrzej Lingas
        Leibniz International Proceedings in Informatics, LIPIcs, 2022年02月01日
      • Upper and lower degree-constrained graph orientation with minimum penalty
        Yuichi Asahiro; Jesper Jansson; Eiji Miyano; Hirotaka Ono
        Theoretical Computer Science, 2022年01月08日
      • New and improved algorithms for unordered tree inclusion
        Tatsuya Akutsu; Jesper Jansson; Ruiming Li; Atsuhiro Takasu; Takeyuki Tamura
        Theoretical Computer Science, 2021年09月03日
      • 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, 2021年09月
      • 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, 2021年06月
      • Computing the Rooted Triplet Distance Between Phylogenetic Networks
        Jesper Jansson; Konstantinos Mampentzidis; Ramesh Rajaby; Wing Kin Sung
        Algorithmica, 2021年06月
      • Graph Orientation with Edge Modifications
        Yuichi Asahiro; Jesper Jansson; Eiji Miyano; Hirotaka Ono; T. P. Sandhya
        International Journal of Foundations of Computer Science, 2021年02月
      • 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, 2020年12月06日
      • 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, 2020年10月24日
      • Better Link Prediction for Protein-Protein Interaction Networks
        Ho Yin Yuen; Jesper Jansson
        Proceedings - IEEE 20th International Conference on Bioinformatics and Bioengineering, BIBE 2020, 2020年10月
      • An efficient algorithm for the rooted triplet distance between galled trees
        Jesper Jansson; Ramesh Rajaby; Wing Kin Sung
        Journal of Computational Biology, 2019年09月
      • Building a small and informative phylogenetic supertree
        Jesper Jansson; Konstantinos Mampentzidis; T. P. Sandhya
        Leibniz International Proceedings in Informatics, LIPIcs, 2019年09月
      • Editorial: Special issue on efficient data structures
        Jesper Jansson
        Algorithms, 2019年07月
      • 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, 2019年03月31日
      • 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, 2018年12月01日
      • Determining the consistency of resolved triplets and fan triplets
        Jesper Jansson; Andrzej Lingas; Ramesh Rajaby; Wing Kin Sung
        Journal of Computational Biology, 2018年07月
      • 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, 2018年04月
      • 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, 2018年01月01日
      • 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, 2017年10月
      • A More Practical Algorithm for the Rooted Triplet Distance
        Jesper Jansson; Ramesh Rajaby
        Journal of Computational Biology, 2017年02月
      • On the parameterized complexity of associative and commutative unification
        Tatsuya Akutsu; Jesper Jansson; Atsuhiro Takasu; Takeyuki Tamura
        Theoretical Computer Science, 2017年01月17日
      • 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, 2016年12月01日
      • Minimal phylogenetic supertrees and local consensus trees
        Jesper Jansson; Wing Kin Sung
        Leibniz International Proceedings in Informatics, LIPIcs, 2016年08月01日
      • 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, 2016年06月22日
      • Improved algorithms for constructing consensus trees
        Jesper Jansson; Chuanqi Shen; Wing Kin Sung
        Journal of the ACM, 2016年06月
      • Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation
        Yuichi Asahiro; Jesper Jansson; Eiji Miyano; Hirotaka Ono
        Theory of Computing Systems, 2016年01月01日
      • 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, 2015年12月01日
      • Graph orientations optimizing the number of light or heavy vertices
        Yuichi Asahiro; Jesper Jansson; Eiji Miyano; Hirotaka Ono
        Journal of Graph Algorithms and Applications, 2015年08月01日
      • Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
        Jesper Jansson; Kunihiko Sadakane; Wing Kin Sung
        Algorithmica, 2015年04月
      • On finding the Adams consensus tree
        Jesper Jansson; Zhaoxian Li; Wing Kin Sung
        Leibniz International Proceedings in Informatics, LIPIcs, 2015年02月01日
      • 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, 2014年03月
      • 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年
      • 次数制約のあるグラフ有向化問題の近似について (Theoretical Foundations of Computing)
        朝廣 雄一; ジャンソン ジェスパー; 宮野 英次; 小野 廣隆
        電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 2013年12月20日
      • Constructing the R*consensus tree of two trees in subcubic time
        Jesper Jansson; Wing Kin Sung
        Algorithmica, 2013年06月
      • 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年, 査読有り
      • Polynomial-time algorithms for building a consensus MUL-tree
        Yun Cui; Jesper Jansson; Wing Kin Sung
        Journal of Computational Biology, 2012年09月01日
      • Faster computation of the Robinson-Foulds distance between phylogenetic networks
        Tetsuo Asano; Jesper Jansson; Kunihiko Sadakane; Ryuhei Uehara; Gabriel Valiente
        Information Sciences, 2012年08月15日
      • 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, 2012年07月27日
      • Inferring a graph from path frequency
        Tatsuya Akutsu; Daiji Fukagawa; Jesper Jansson; Kunihiko Sadakane
        Discrete Applied Mathematics, 2012年07月
      • Ultra-succinct representation of ordered trees with applications
        Jesper Jansson; Kunihiko Sadakane; Wing Kin Sung
        Journal of Computer and System Sciences, 2012年03月
      • 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年, 査読有り
      • Minimizing Penalty on Upper and Lower Degree Constrained Graph Orientation (コンピュテーション)
        朝廣 雄一; JANSSON Jesper; 宮野 英次; 小野 廣隆
        電子情報通信学会技術研究報告 : 信学技報, 2011年12月16日
      • 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, 2011年12月
      • 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, 2011年07月
      • Algorithms for Finding a Most Similar Subforest
        Jesper Jansson; Zeshan Peng
        Theory of Computing Systems, 2011年05月
      • Graph orientation to maximize the minimum weighted outdegree
        Yuichi Asahiro; Jesper Jansson; Eiji Miyano; Hirotaka Ono
        International Journal of Foundations of Computer Science, 2011年04月
      • Flexible taxonomic assignment of ambiguous sequencing reads
        José C. Clemente; Jesper Jansson; Gabriel Valiente
        BMC Bioinformatics, 2011年01月07日
      • 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, 2010年06月06日
      • Linear-time protein 3-D structure searching with insertions and deletions
        Tetsuo Shibuya; Jesper Jansson; Kunihiko Sadakane
        Algorithms for Molecular Biology, 2010年01月04日
      • 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年, 査読有り
      • 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年, 査読有り
      • 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), 2007年07月
      • Online and dynamic recognition of squarefree strings
        Jesper Jansson; Zeshan Peng
        International Journal of Foundations of Computer Science, 2007年04月
      • 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, 2007年04月
      • 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, 2006年10月25日
      • 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), 2006年10月
      • 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, 2006年08月
      • 最大重み付き出次数を最小化するグラフ有向化問題の近似(不)可能性
        朝廣雄一; Jesper Jansson; 宮野 英次; 小野 廣隆; 善明紘平
        情報処理学会研究報告アルゴリズム(AL), 2006年07月03日
      • Local gapped subforest alignment and its application in finding RNA structural motifs
        Jesper Jansson; Ngo Trung Hieu; Wing Kin Sung
        Journal of Computational Biology, 2006年04月
      • 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), 2005年12月
      • Computing the maximum agreement of phylogenetic networks
        Charles Choy; Jesper Jansson; Kunihiko Sadakane; Wing Kin Sung
        Theoretical Computer Science, 2005年05月20日
      • 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, 2004年06月
      • Computing the maximum agreement of phylogenetic networks
        Charles Choy; Jesper Jansson; Kunihiko Sadakane; Wing Kin Sung
        Electronic Notes in Theoretical Computer Science, 2004年02月16日
      • 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, 2003年07月
      • グラフの準平衡彩色 ? ディスクレパンシー条件による2色彩色
        ジェスパージャンソン; 徳山 豪
        情報処理学会研究報告アルゴリズム(AL), 2002年07月25日
      • On the complexity of inferring rooted evolutionary trees
        Jesper Jansson
        Electronic Notes in Discrete Mathematics, 2001年04月
      • 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年, 査読有り
      • 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年

      受賞

      • 2020年10月28日
        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", アメリカ合衆国, 国内外の国際的学術賞
        Ho Yin Yuen, Jesper Jansson

      外部資金:科学研究費補助金

      • Phylogenetic Network Simplification
        基盤研究(B)
        小区分60010:情報学基礎論関連
        京都大学
        ジャンソン ジェスパー
        自 2022年04月01日, 至 2025年03月31日, 交付
        algorithm;computational complexity;phylogenetic network;distance functions;structural parameters;MUL-tree;pruning;phylogenetics
      • Phylogenetic Network Simplification
        基盤研究(B)
        小区分60010:情報学基礎論関連
        京都大学
        ジャンソン ジェスパー
        自 2022年04月01日, 至 2025年03月31日, 交付
        algorithm;computational complexity;phylogenetic network;distance functions;structural parameters;MUL-tree;pruning;phylogenetics
      • Fast Graph Algorithms for Phylogenetics
        基盤研究(C)
        京都大学
        ジャンソン ジェスパー
        自 2014年04月01日, 至 2018年03月31日, 完了
        Algorithm theory;Computational complexity;Implementations;Graph algorithms;Phylogenetic tree;Consensus tree;Supertree;algorithm;computational complexity;phylogenetic tree;consensus tree
      • Comparing and Combining Trees
        若手研究(B)
        京都大学;お茶の水女子大学
        ジャンソン ジェスパー
        自 2011年04月01日, 至 2014年03月31日, 完了
        アルゴリズム;計算複雑さ;系統樹;algorithm;computational complexity;phylogenetic tree;consensus tree;rooted triplet distance;計算複雑性;順序木;超系統樹;合意樹;類似度
      • Matrix multiplication via 3D partitioning
        挑戦的研究(萌芽)
        中区分60:情報科学、情報工学およびその関連分野
        京都大学
        ジャンソン ジェスパー
        自 2024年06月28日, 至 2027年03月31日, 採択
      • Matrix multiplication via 3D partitioning
        挑戦的研究(萌芽)
        中区分60:情報科学、情報工学およびその関連分野
        京都大学
        ジャンソン ジェスパー
        自 2024年06月28日, 至 2027年03月31日, 交付
        algorithm;time complexity;matrix multiplication;histogram;partitioning
      list
        Last Updated :2025/05/02

        教育

        担当科目

        • 自 2021年04月01日, 至 2022年03月31日
          Introduction to Formal Languages-E2
          T065, 前期, 国際高等教育院
        • 自 2021年04月01日, 至 2022年03月31日
          Introduction to Formal Languages-E2
          T065, 後期, 国際高等教育院
        • 自 2022年04月01日, 至 2023年03月31日
          Introduction to Formal Languages-E2
          T065, 前期, 国際高等教育院, 2
        • 自 2022年04月01日, 至 2023年03月31日
          Introduction to Formal Languages-E2
          T065, 後期, 国際高等教育院, 2
        • 自 2023年04月01日, 至 2024年03月31日
          Introduction to Formal Languages-E2
          T065, 前期, 国際高等教育院, 2
        • 自 2023年04月01日, 至 2024年03月31日
          Introduction to Formal Languages-E2
          T065, 後期, 国際高等教育院, 2
        • 自 2024年04月01日, 至 2025年03月31日
          Introduction to Formal Languages-E2
          T065, 前期, 国際高等教育院, 2
        • 自 2024年04月01日, 至 2025年03月31日
          Introduction to Formal Languages-E2
          T065, 後期, 国際高等教育院, 2
        • 自 2021年04月01日, 至 2022年03月31日
          Introduction to Algorithms-E2
          T052, 前期, 国際高等教育院
        • 自 2021年04月01日, 至 2022年03月31日
          Introduction to Algorithms-E2
          T052, 後期, 国際高等教育院
        • 自 2022年04月01日, 至 2023年03月31日
          Introduction to Algorithms-E2
          T052, 前期, 国際高等教育院, 2
        • 自 2022年04月01日, 至 2023年03月31日
          Introduction to Algorithms-E2
          T052, 後期, 国際高等教育院, 2
        • 自 2023年04月01日, 至 2024年03月31日
          Introduction to Algorithms-E2
          T052, 前期, 国際高等教育院, 2
        • 自 2023年04月01日, 至 2024年03月31日
          Introduction to Algorithms-E2
          T052, 後期, 国際高等教育院, 2
        • 自 2024年04月01日, 至 2025年03月31日
          Introduction to Algorithms-E2
          T052, 前期, 国際高等教育院, 2
        • 自 2024年04月01日, 至 2025年03月31日
          Introduction to Algorithms-E2
          T052, 後期, 国際高等教育院, 2
        • 自 2021年04月01日, 至 2022年03月31日
          アルゴリズムと情報学入門
          M307, 前期, 国際高等教育院
        • 自 2022年04月01日, 至 2023年03月31日
          Introduction to Algorithms and Informatics
          M307, 前期, 国際高等教育院, 2
        • 自 2023年04月01日, 至 2024年03月31日
          Introduction to Algorithms and Informatics
          M307, 前期, 国際高等教育院, 2
        • 自 2024年04月01日, 至 2025年03月31日
          Introduction to Algorithms and Informatics
          M307, 前期, 国際高等教育院, 2
        • 自 2021年04月01日, 至 2022年03月31日
          アルゴリズムと情報学入門
          3618, 前期, 情報学研究科, 2
        • 自 2022年04月01日, 至 2023年03月31日
          アルゴリズムと情報学入門
          3618, 前期, 情報学研究科, 2
        • 自 2023年04月01日, 至 2024年03月31日
          アルゴリズムと情報学入門
          3618, 前期, 情報学研究科, 2
        • 自 2024年04月01日, 至 2025年03月31日
          アルゴリズムと情報学入門
          3618, 前期, 情報学研究科, 2
        • 自 2021年04月01日, 至 2022年03月31日
          計算量理論
          3614, 後期, 情報学研究科, 2
        • 自 2022年04月01日, 至 2023年03月31日
          計算量理論
          3614, 後期, 情報学研究科, 2
        • 自 2023年04月01日, 至 2024年03月31日
          計算量理論
          3614, 後期, 情報学研究科, 2
        • 自 2024年04月01日, 至 2025年03月31日
          計算量理論
          3614, 後期, 情報学研究科, 2
        • 自 2021年04月01日, 至 2022年03月31日
          情報学展望5
          8045, 後期, 情報学研究科, 2
        • 自 2022年04月01日, 至 2023年03月31日
          情報学展望5
          8045, 後期, 情報学研究科, 2
        • 自 2023年04月01日, 至 2024年03月31日
          情報学展望5
          8045, 後期, 情報学研究科, 2
        • 自 2024年04月01日, 至 2025年03月31日
          情報学展望5
          8045, 後期, 情報学研究科, 2

        学外学位論文審査

        • On Phylogenetic Encodings and Orchard Networks
          Yukihiro Murakami, TU Delft, The Netherlands, 副査
          2021年11月29日
        • Dynamic and Probabilistic Models in Optimization: Algorithms for Combinatorial Problems with Applications in Machine Learning
          Bo Wang, The University of Hong Kong (HKU), China, 副査
          2024年01月10日

        ページ上部へ戻る