Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarJesper Jansson
Person information
- affiliation: The Hong Kong Polytechnic University, China
- affiliation: Kyoto University, Japan
- affiliation (PhD 2003): Lund University, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2018
[j46]Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu:
3D Rectangulations and Geometric Matrix Multiplication. Algorithmica 80(1): 136-154 (2018)- [j45]Jesper Jansson, Ramesh Rajaby, Chuanqi Shen, Wing-Kin Sung:
Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree. IEEE/ACM Trans. Comput. Biology Bioinform. 15(1): 15-26 (2018) - [c55]Tatsuya Akutsu, Jesper Jansson, Ruiming Li, Atsuhiro Takasu, Takeyuki Tamura:
New and Improved Algorithms for Unordered Tree Inclusion. ISAAC 2018: 27:1-27:12 - [c54]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono:
Graph Orientation with Splits. ISCO 2018: 52-63 - [e1]Jesper Jansson, Carlos Martín-Vide, Miguel A. Vega-Rodríguez:
Algorithms for Computational Biology - 5th International Conference, AlCoB 2018, Hong Kong, China, June 25-26, 2018, Proceedings. Lecture Notes in Computer Science 10849, Springer 2018, ISBN 978-3-319-91937-9 [contents] - 2017
- [j44]Jesper Jansson, Zhaoxian Li, Wing-Kin Sung:
On finding the Adams consensus tree. Inf. Comput. 256: 334-347 (2017) - [j43]Jesper Jansson, Ramesh Rajaby:
A More Practical Algorithm for the Rooted Triplet Distance. Journal of Computational Biology 24(2): 106-126 (2017) - [j42]Tatsuya Akutsu, Jesper Jansson, Atsuhiro Takasu, Takeyuki Tamura:
On the parameterized complexity of associative and commutative unification. Theor. Comput. Sci. 660: 57-74 (2017) - [c53]Jesper Jansson, Ramesh Rajaby, Wing-Kin Sung:
An Efficient Algorithm for the Rooted Triplet Distance Between Galled Trees. AlCoB 2017: 115-126 - [c52]Jesper Jansson, Andrzej Lingas, Ramesh Rajaby, Wing-Kin Sung:
Determining the Consistency of Resolved Triplets and Fan Triplets. RECOMB 2017: 82-98 - [i4]Tatsuya Akutsu, Jesper Jansson, Ruiming Li, Atsuhiro Takasu, Takeyuki Tamura:
New Algorithms for Unordered Tree Inclusion. CoRR abs/1712.05517 (2017) - 2016
- [j41]Jesper Jansson, Wing-Kin Sung, Hoa Vu, Siu-Ming Yiu:
Faster Algorithms for Computing the R* Consensus Tree. Algorithmica 76(4): 1224-1244 (2016) - [j40]Jesper Jansson, Chuanqi Shen, Wing-Kin Sung:
Improved Algorithms for Constructing Consensus Trees. J. ACM 63(3): 28:1-28:24 (2016) - [j39]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. Theory Comput. Syst. 58(1): 60-93 (2016) - [c51]Tomoya Mori, Atsuhiro Takasu, Jesper Jansson, Jaewook Hwang, Takeyuki Tamura, Tatsuya Akutsu:
Similar subtree search using extended tree inclusion. ICDE 2016: 1558-1559 - [c50]Jesper Jansson, Wing-Kin Sung:
Minimal Phylogenetic Supertrees and Local Consensus Trees. MFCS 2016: 53:1-53:14 - [r8]Jesper Jansson, Wing-Kin Sung:
Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network. Encyclopedia of Algorithms 2016: 48-52 - [r7]Jesper Jansson:
Directed Perfect Phylogeny (Binary Characters). Encyclopedia of Algorithms 2016: 553-556 - [r6]Jesper Jansson, Wing-Kin Sung:
Maximum Agreement Supertree. Encyclopedia of Algorithms 2016: 1224-1227 - [r5]Jesper Jansson:
Perfect Phylogeny (Bounded Number of States). Encyclopedia of Algorithms 2016: 1550-1553 - [r4]Jesper Jansson:
Phylogenetic Tree Construction from a Distance Matrix. Encyclopedia of Algorithms 2016: 1564-1567 - 2015
- [j38]Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. Algorithmica 71(4): 969-988 (2015) - [j37]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Graph Orientations Optimizing the Number of Light or Heavy Vertices. J. Graph Algorithms Appl. 19(1): 441-465 (2015) - [j36]Tomoya Mori, Atsuhiro Takasu, Jesper Jansson, Jaewook Hwang, Takeyuki Tamura, Tatsuya Akutsu:
Similar Subtree Search Using Extended Tree Inclusion. IEEE Trans. Knowl. Data Eng. 27(12): 3360-3373 (2015) - [c49]Jesper Jansson, Ramesh Rajaby:
A More Practical Algorithm for the Rooted Triplet Distance. AlCoB 2015: 109-125 - [c48]Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell:
The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets. CPM 2015: 272-283 - [c47]Jesper Jansson, Zhaoxian Li, Wing-Kin Sung:
On Finding the Adams Consensus Tree. STACS 2015: 487-499 - 2014
- [j35]Jesper Jansson, Andrzej Lingas:
Computing the rooted triplet distance between galled trees by counting triangles. J. Discrete Algorithms 25: 66-78 (2014) - [j34]Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Fast relative Lempel-Ziv self-index for similar sequences. Theor. Comput. Sci. 532: 14-30 (2014) - [c46]Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu:
3D Rectangulations and Geometric Matrix Multiplication. ISAAC 2014: 65-78 - [c45]Jesper Jansson, Wing-Kin Sung, Hoa Vu, Siu-Ming Yiu:
Faster Algorithms for Computing the R* Consensus Tree. ISAAC 2014: 414-425 - [c44]Tatsuya Akutsu, Jesper Jansson, Atsuhiro Takasu, Takeyuki Tamura:
On the Parameterized Complexity of Associative and Commutative Unification. IPEC 2014: 15-27 - 2013
- [j33]Jesper Jansson, Wing-Kin Sung:
Constructing the R* Consensus Tree of Two Trees in Subcubic Time. Algorithmica 66(2): 329-345 (2013) - [j32]
- [c43]Jesper Jansson, Chuanqi Shen, Wing-Kin Sung:
An Optimal Algorithm for Building the Majority Rule Consensus Tree. RECOMB 2013: 88-99 - [c42]Jesper Jansson, Chuanqi Shen, Wing-Kin Sung:
Improved Algorithms for Constructing Consensus Trees. SODA 2013: 1800-1813 - [c41]Jesper Jansson, Chuanqi Shen, Wing-Kin Sung:
Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree. WABI 2013: 141-155 - [c40]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. WAOA 2013: 24-36 - [i3]Jesper Jansson, Chuanqi Shen, Wing-Kin Sung:
Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree. CoRR abs/1307.7821 (2013) - 2012
- [j31]Tatsuya Akutsu, Daiji Fukagawa, Jesper Jansson, Kunihiko Sadakane:
Inferring a graph from path frequency. Discrete Applied Mathematics 160(10-11): 1416-1428 (2012) - [j30]Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente:
Faster computation of the Robinson-Foulds distance between phylogenetic networks. Inf. Sci. 197: 77-90 (2012) - [j29]Yun Cui, Jesper Jansson, Wing-Kin Sung:
Polynomial-Time Algorithms for Building a Consensus MUL-Tree. Journal of Computational Biology 19(9): 1073-1088 (2012) - [j28]Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Ultra-succinct representation of ordered trees with applications. J. Comput. Syst. Sci. 78(2): 619-631 (2012) - [j27]Jesper Jansson, Richard S. Lemence, Andrzej Lingas:
The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree. SIAM J. Comput. 41(1): 272-291 (2012) - [j26]Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell Martin, Kunihiko Sadakane, Wing-Kin Sung:
More efficient periodic traversal in anonymous undirected graphs. Theor. Comput. Sci. 444: 60-76 (2012) - [c39]Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Fast Relative Lempel-Ziv Self-index for Similar Sequences. FAW-AAIM 2012: 291-302 - [c38]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty. CATS 2012: 139-146 - [c37]Jesper Jansson, Andrzej Lingas:
Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles. CPM 2012: 385-398 - [c36]Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
CRAM: Compressed Random Access Memory. ICALP (1) 2012: 510-521 - [c35]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Graph Orientations Optimizing the Number of Light or Heavy Vertices. ISCO 2012: 332-343 - [c34]Kun-Mao Chao, An-Chiang Chu, Jesper Jansson, Richard S. Lemence, Alban Mancheron:
Asymptotic Limits of a New Type of Maximization Recurrence with an Application to Bioinformatics. TAMC 2012: 177-188 - 2011
- [j25]José Carlos Clemente, Jesper Jansson, Gabriel Valiente:
Flexible taxonomic assignment of ambiguous sequencing reads. BMC Bioinformatics 12: 8 (2011) - [j24]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Graph Orientation to Maximize the Minimum Weighted Outdegree. Int. J. Found. Comput. Sci. 22(3): 583-601 (2011) - [j23]Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski:
Approximation Algorithms for Buy-at-Bulk Geometric Network Design. Int. J. Found. Comput. Sci. 22(8): 1949-1969 (2011) - [j22]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo:
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. J. Comb. Optim. 22(1): 78-96 (2011) - [j21]Jesper Jansson, Zeshan Peng:
Algorithms for Finding a Most Similar Subforest. Theory Comput. Syst. 48(4): 865-887 (2011) - [j20]Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung:
Computing a Smallest Multilabeled Phylogenetic Tree from Rooted Triplets. IEEE/ACM Trans. Comput. Biology Bioinform. 8(4): 1141-1147 (2011) - [c33]Yun Cui, Jesper Jansson, Wing-Kin Sung:
Algorithms for Building Consensus MUL-trees. ISAAC 2011: 744-753 - 2010
- [j19]Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane:
Linear-time protein 3-D structure searching with insertions and deletions. Algorithms for Molecular Biology 5: 7 (2010) - [j18]Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson:
New results on optimizing rooted triplets consistency. Discrete Applied Mathematics 158(11): 1136-1147 (2010) - [c32]Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente:
Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. CPM 2010: 190-201 - [c31]Jesper Jansson, Wing-Kin Sung:
Constructing the R* Consensus Tree of Two Trees in Subcubic Time. ESA (1) 2010: 573-584 - [c30]José Carlos Clemente, Jesper Jansson, Gabriel Valiente:
Accurate Taxonomic Assignment of Short Pyrosequencing Reads. Pacific Symposium on Biocomputing 2010: 3-9 - [c29]Jesper Jansson, Richard S. Lemence, Andrzej Lingas:
The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree. WABI 2010: 262-273 - [i2]Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Compressed random access memory. CoRR abs/1011.1708 (2010)
2000 – 2009
- 2009
- [c28]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Graph orientation to maximize the minimum weighted outdegree. IPDPS 2009: 1-8 - [c27]Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung:
Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets. ISAAC 2009: 1205-1214 - [c26]Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung:
More Efficient Periodic Traversal in Anonymous Undirected Graphs. SIROCCO 2009: 167-181 - [c25]Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane:
Linear-Time Protein 3-D Structure Searching with Insertions and Deletions. WABI 2009: 310-320 - [c24]Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski:
Approximation Algorithms for Buy-at-Bulk Geometric Network Design. WADS 2009: 168-180 - [i1]Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Yannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung:
More efficient periodic traversal in anonymous undirected graphs. CoRR abs/0905.1737 (2009) - 2008
- [c23]Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson:
New Results on Optimizing Rooted Triplets Consistency. ISAAC 2008: 484-495 - [r3]
- [r2]
- [r1]Jesper Jansson:
Phylogenetic Tree Construction from a Distance Matrix. Encyclopedia of Algorithms 2008 - 2007
- [j17]Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell:
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. Algorithmica 48(3): 233-248 (2007) - [j16]Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson:
On the Approximability of Maximum and Minimum Edge Clique Partition Problems. Int. J. Found. Comput. Sci. 18(2): 217-226 (2007) - [j15]Jesper Jansson, Zeshan Peng:
Online and Dynamic Recognition of Squarefree Strings. Int. J. Found. Comput. Sci. 18(2): 401-414 (2007) - [c22]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo:
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree. AAIM 2007: 167-177 - [c21]Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. FSTTCS 2007: 424-435 - [c20]Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Ultra-succinct representation of ordered trees. SODA 2007: 575-584 - 2006
- [j14]Jesper Jansson, See-Kiong Ng, Wing-Kin Sung, Hugo Willy:
A Faster and More Space-Efficient Algorithm for Inferring Arc-Annotations of RNA Sequences through Alignment. Algorithmica 46(2): 223-245 (2006) - [j13]Ying-Jun He, Trinh N. D. Huynh, Jesper Jansson, Wing-Kin Sung:
Inferring Phylogenetic Relationships Avoiding Forbidden Rooted Triplets. J. Bioinformatics and Computational Biology 4(1): 59-74 (2006) - [j12]Ho-Leung Chan, Jesper Jansson, Tak Wah Lam, Siu-Ming Yiu:
Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix. J. Bioinformatics and Computational Biology 4(4): 807-832 (2006) - [j11]Jesper Jansson, Ngo Trung Hieu, Wing-Kin Sung:
Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs. Journal of Computational Biology 13(3): 702-718 (2006) - [j10]Jesper Jansson, Nguyen Bao Nguyen, Wing-Kin Sung:
Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network. SIAM J. Comput. 35(5): 1098-1121 (2006) - [j9]Jesper Jansson, Wing-Kin Sung:
Inferring a level-1 phylogenetic network from a dense set of rooted triplets. Theor. Comput. Sci. 363(1): 60-68 (2006) - [c19]Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson:
On the Approximability of Maximum and Minimum Edge Clique Partition Problems. CATS 2006: 101-105 - [c18]
- 2005
- [j8]Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung:
Rooted Maximum Agreement Supertrees. Algorithmica 43(4): 293-307 (2005) - [j7]Charles Choy, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Computing the maximum agreement of phylogenetic networks. Theor. Comput. Sci. 335(1): 93-107 (2005) - [c17]Ying-Jun He, Trinh N. D. Huynh, Jesper Jansson, Wing-Kin Sung:
Inferring phylogenetic relationships avoiding forbidden rooted triplets. APBC 2005: 339-348 - [c16]Ho-Leung Chan, Jesper Jansson, Tak Wah Lam, Siu-Ming Yiu:
Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix. MFCS 2005: 224-235 - [c15]Jesper Jansson, Zeshan Peng:
Online and Dynamic Recognition of Squarefree Strings. MFCS 2005: 520-531 - [c14]Trinh N. D. Huynh, Jesper Jansson, Nguyen Bao Nguyen, Wing-Kin Sung:
Constructing a Smallest Refining Galled Phylogenetic Network. RECOMB 2005: 265-280 - [c13]Stefan Dobrev, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Finding Short Right-Hand-on-the-Wall Walks in Graphs. SIROCCO 2005: 127-139 - [c12]Jesper Jansson, Nguyen Bao Nguyen, Wing-Kin Sung:
Algorithms for combining rooted triplets into a galled phylogenetic network. SODA 2005: 349-358 - 2004
- [j6]Charles Choy, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Computing the Maximum Agreement of Phylogenetic Networks. Electr. Notes Theor. Comput. Sci. 91: 134-147 (2004) - [j5]Jesper Jansson, Takeshi Tokuyama:
Semi-Balanced Colorings of Graphs: Generalized 2-Colorings Based on a Relaxed Discrepancy Condition. Graphs and Combinatorics 20(2): 205-222 (2004) - [j4]Leszek Gasieniec, Jesper Jansson, Andrzej Lingas:
Approximation algorithms for Hamming clustering problems. J. Discrete Algorithms 2(2): 289-301 (2004) - [c11]Jesper Jansson, Wing-Kin Sung:
Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets. COCOON 2004: 462-472 - [c10]Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell:
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. CPM 2004: 220-229 - [c9]Jesper Jansson, Ngo Trung Hieu, Wing-Kin Sung:
Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs. ISAAC 2004: 569-580 - [c8]Jesper Jansson, Wing-Kin Sung:
The Maximum Agreement of Two Nested Phylogenetic Networks. ISAAC 2004: 581-593 - [c7]Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung:
Rooted Maximum Agreement Supertrees. LATIN 2004: 499-508 - [c6]Jesper Jansson, See-Kiong Ng, Wing-Kin Sung, Hugo Willy:
A Faster and More Space-Efficient Algorithm for Inferring Arc-Annotations of RNA Sequences Through Alignment. WABI 2004: 302-313 - 2003
- [j3]Jesper Jansson, Andrzej Lingas:
A Fast Algorithm for Optimal Alignment between Similar Ordered Trees. Fundam. Inform. 56(1-2): 105-120 (2003) - 2001
- [j2]Jesper Jansson:
On the Complexity of Inferring Rooted Evolutionary Trees. Electronic Notes in Discrete Mathematics 7: 50-53 (2001) - [c5]Jesper Jansson, Andrzej Lingas:
A Fast Algorithm for Optimal Alignment between Similar Ordered Trees. CPM 2001: 232-240 - 2000
- [c4]Leszek Gasieniec, Jesper Jansson, Andrzej Lingas:
Approximation Algorithms for Hamming Clustering Problems. CPM 2000: 108-118
1990 – 1999
- 1999
- [j1]Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin:
On the Complexity of Constructing Evolutionary Trees. J. Comb. Optim. 3(2-3): 183-197 (1999) - [c3]Leszek Gasieniec, Jesper Jansson, Andrzej Lingas:
Efficient Approximation Algorithms for the Hamming Center Problem. SODA 1999: 905-906 - 1998
- [c2]Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin:
Inferring Ordered Trees from Local Constraints. CATS 1998: 67-76 - 1997
- [c1]Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin:
On the Complexity of Computing Evolutionary Trees. COCOON 1997: 134-145
Coauthor Index
maintained by 
, founded at 
, founded at 
last updated on 2019-01-09 01:17 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
