2008 |
43 | EE | Jaroslaw Byrka,
Sylvain Guillemot,
Jesper Jansson:
New Results on Optimizing Rooted Triplets Consistency.
ISAAC 2008: 484-495 |
42 | EE | Jesper Jansson:
Directed Perfect Phylogeny (Binary Characters).
Encyclopedia of Algorithms 2008 |
41 | EE | Jesper Jansson:
Perfect Phylogeny (Bounded Number of States).
Encyclopedia of Algorithms 2008 |
40 | EE | Jesper Jansson:
Phylogenetic Tree Construction from a Distance Matrix.
Encyclopedia of Algorithms 2008 |
2007 |
39 | EE | 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 |
38 | EE | Jesper Jansson,
Kunihiko Sadakane,
Wing-Kin Sung:
Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space.
FSTTCS 2007: 424-435 |
37 | EE | Jesper Jansson,
Kunihiko Sadakane,
Wing-Kin Sung:
Ultra-succinct representation of ordered trees.
SODA 2007: 575-584 |
36 | EE | 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) |
35 | EE | 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) |
34 | EE | Jesper Jansson,
Zeshan Peng:
Online and Dynamic Recognition of Squarefree Strings.
Int. J. Found. Comput. Sci. 18(2): 401-414 (2007) |
2006 |
33 | EE | 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 |
32 | EE | Jesper Jansson,
Zeshan Peng:
Algorithms for Finding a Most Similar Subforest.
CPM 2006: 377-388 |
31 | EE | 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) |
30 | EE | 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) |
29 | EE | 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) |
28 | EE | 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) |
27 | EE | 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) |
26 | EE | 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) |
2005 |
25 | EE | Ying-Jun He,
Trinh N. D. Huynh,
Jesper Jansson,
Wing-Kin Sung:
Inferring phylogenetic relationships avoiding forbidden rooted triplets.
APBC 2005: 339-348 |
24 | EE | 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 |
23 | EE | Jesper Jansson,
Zeshan Peng:
Online and Dynamic Recognition of Squarefree Strings.
MFCS 2005: 520-531 |
22 | EE | Trinh N. D. Huynh,
Jesper Jansson,
Nguyen Bao Nguyen,
Wing-Kin Sung:
Constructing a Smallest Refining Galled Phylogenetic Network.
RECOMB 2005: 265-280 |
21 | EE | Stefan Dobrev,
Jesper Jansson,
Kunihiko Sadakane,
Wing-Kin Sung:
Finding Short Right-Hand-on-the-Wall Walks in Graphs.
SIROCCO 2005: 127-139 |
20 | EE | Jesper Jansson,
Nguyen Bao Nguyen,
Wing-Kin Sung:
Algorithms for combining rooted triplets into a galled phylogenetic network.
SODA 2005: 349-358 |
19 | EE | Jesper Jansson,
Joseph H.-K. Ng,
Kunihiko Sadakane,
Wing-Kin Sung:
Rooted Maximum Agreement Supertrees.
Algorithmica 43(4): 293-307 (2005) |
18 | EE | Charles Choy,
Jesper Jansson,
Kunihiko Sadakane,
Wing-Kin Sung:
Computing the maximum agreement of phylogenetic networks.
Theor. Comput. Sci. 335(1): 93-107 (2005) |
2004 |
17 | EE | Jesper Jansson,
Wing-Kin Sung:
Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets.
COCOON 2004: 462-472 |
16 | EE | Anders Dessmark,
Jesper Jansson,
Andrzej Lingas,
Eva-Marta Lundell:
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem.
CPM 2004: 220-229 |
15 | EE | Jesper Jansson,
Ngo Trung Hieu,
Wing-Kin Sung:
Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs.
ISAAC 2004: 569-580 |
14 | EE | Jesper Jansson,
Wing-Kin Sung:
The Maximum Agreement of Two Nested Phylogenetic Networks.
ISAAC 2004: 581-593 |
13 | EE | Jesper Jansson,
Joseph H.-K. Ng,
Kunihiko Sadakane,
Wing-Kin Sung:
Rooted Maximum Agreement Supertrees.
LATIN 2004: 499-508 |
12 | EE | 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 |
11 | EE | 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) |
10 | EE | 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) |
9 | EE | Leszek Gasieniec,
Jesper Jansson,
Andrzej Lingas:
Approximation algorithms for Hamming clustering problems.
J. Discrete Algorithms 2(2): 289-301 (2004) |
2003 |
8 | EE | Jesper Jansson,
Andrzej Lingas:
A Fast Algorithm for Optimal Alignment between Similar Ordered Trees.
Fundam. Inform. 56(1-2): 105-120 (2003) |
2001 |
7 | EE | Jesper Jansson,
Andrzej Lingas:
A Fast Algorithm for Optimal Alignment between Similar Ordered Trees.
CPM 2001: 232-240 |
6 | EE | Jesper Jansson:
On the Complexity of Inferring Rooted Evolutionary Trees.
Electronic Notes in Discrete Mathematics 7: 50-53 (2001) |
2000 |
5 | EE | Leszek Gasieniec,
Jesper Jansson,
Andrzej Lingas:
Approximation Algorithms for Hamming Clustering Problems.
CPM 2000: 108-118 |
1999 |
4 | EE | Leszek Gasieniec,
Jesper Jansson,
Andrzej Lingas:
Efficient Approximation Algorithms for the Hamming Center Problem.
SODA 1999: 905-906 |
3 | | Leszek Gasieniec,
Jesper Jansson,
Andrzej Lingas,
Anna Östlin:
On the Complexity of Constructing Evolutionary Trees.
J. Comb. Optim. 3(2-3): 183-197 (1999) |
1998 |
2 | | Leszek Gasieniec,
Jesper Jansson,
Andrzej Lingas,
Anna Östlin:
Inferring Ordered Trees from Local Constraints.
CATS 1998: 67-76 |
1997 |
1 | | Leszek Gasieniec,
Jesper Jansson,
Andrzej Lingas,
Anna Östlin:
On the Complexity of Computing Evolutionary Trees.
COCOON 1997: 134-145 |