|
Search the dblp DataBase
Jesper Jansson:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Ying-Jun He, Trinh N. D. Huynh, Jesper Jansson, Wing-Kin Sung
Inferring phylogenetic relationships avoiding forbidden rooted triplets. [Citation Graph (0, 0)][DBLP] APBC, 2005, pp:339-348 [Conf]
- Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin
On the Complexity of Computing Evolutionary Trees. [Citation Graph (0, 0)][DBLP] COCOON, 1997, pp:134-145 [Conf]
- Jesper Jansson, Wing-Kin Sung
Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets. [Citation Graph (0, 0)][DBLP] COCOON, 2004, pp:462-472 [Conf]
- Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. [Citation Graph (0, 0)][DBLP] CPM, 2004, pp:220-229 [Conf]
- Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
Approximation Algorithms for Hamming Clustering Problems. [Citation Graph (0, 0)][DBLP] CPM, 2000, pp:108-118 [Conf]
- Jesper Jansson, Andrzej Lingas
A Fast Algorithm for Optimal Alignment between Similar Ordered Trees. [Citation Graph (0, 0)][DBLP] CPM, 2001, pp:232-240 [Conf]
- Jesper Jansson, Zeshan Peng
Algorithms for Finding a Most Similar Subforest. [Citation Graph (0, 0)][DBLP] CPM, 2006, pp:377-388 [Conf]
- Jesper Jansson, Ngo Trung Hieu, Wing-Kin Sung
Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs. [Citation Graph (0, 0)][DBLP] ISAAC, 2004, pp:569-580 [Conf]
- Jesper Jansson, Wing-Kin Sung
The Maximum Agreement of Two Nested Phylogenetic Networks. [Citation Graph (0, 0)][DBLP] ISAAC, 2004, pp:581-593 [Conf]
- Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung
Rooted Maximum Agreement Supertrees. [Citation Graph (0, 0)][DBLP] LATIN, 2004, pp:499-508 [Conf]
- Ho-Leung Chan, Jesper Jansson, Tak Wah Lam, Siu-Ming Yiu
Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix. [Citation Graph (0, 0)][DBLP] MFCS, 2005, pp:224-235 [Conf]
- Jesper Jansson, Zeshan Peng
Online and Dynamic Recognition of Squarefree Strings. [Citation Graph (0, 0)][DBLP] MFCS, 2005, pp:520-531 [Conf]
- Trinh N. D. Huynh, Jesper Jansson, Nguyen Bao Nguyen, Wing-Kin Sung
Constructing a Smallest Refining Galled Phylogenetic Network. [Citation Graph (0, 0)][DBLP] RECOMB, 2005, pp:265-280 [Conf]
- Shlomi Dobrev, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
Finding Short Right-Hand-on-the-Wall Walks in Graphs. [Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:127-139 [Conf]
- Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
Efficient Approximation Algorithms for the Hamming Center Problem. [Citation Graph (0, 0)][DBLP] SODA, 1999, pp:905-906 [Conf]
- Jesper Jansson, Nguyen Bao Nguyen, Wing-Kin Sung
Algorithms for combining rooted triplets into a galled phylogenetic network. [Citation Graph (0, 0)][DBLP] SODA, 2005, pp:349-358 [Conf]
- 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. [Citation Graph (0, 0)][DBLP] WABI, 2004, pp:302-313 [Conf]
- Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung
Rooted Maximum Agreement Supertrees. [Citation Graph (0, 0)][DBLP] Algorithmica, 2005, v:43, n:4, pp:293-307 [Journal]
- 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. [Citation Graph (0, 0)][DBLP] Algorithmica, 2006, v:46, n:2, pp:223-245 [Journal]
- Charles Choy, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
Computing the Maximum Agreement of Phylogenetic Networks. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2004, v:91, n:, pp:134-147 [Journal]
- Jesper Jansson, Andrzej Lingas
A Fast Algorithm for Optimal Alignment between Similar Ordered Trees. [Citation Graph (0, 0)][DBLP] Fundam. Inform., 2003, v:56, n:1-2, pp:105-120 [Journal]
- Jesper Jansson, Takeshi Tokuyama
Semi-Balanced Colorings of Graphs: Generalized 2-Colorings Based on a Relaxed Discrepancy Condition. [Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2004, v:20, n:2, pp:205-222 [Journal]
- Ying-Jun He, Trinh N. D. Huynh, Jesper Jansson, Wing-Kin Sung
Inferring Phylogenetic Relationships Avoiding Forbidden Rooted Triplets. [Citation Graph (0, 0)][DBLP] J. Bioinformatics and Computational Biology, 2006, v:4, n:1, pp:59-74 [Journal]
- Ho-Leung Chan, Jesper Jansson, Tak Wah Lam, Siu-Ming Yiu
Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix. [Citation Graph (0, 0)][DBLP] J. Bioinformatics and Computational Biology, 2006, v:4, n:4, pp:807-832 [Journal]
- Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin
On the Complexity of Constructing Evolutionary Trees. [Citation Graph (0, 0)][DBLP] J. Comb. Optim., 1999, v:3, n:2-3, pp:183-197 [Journal]
- Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
Approximation algorithms for Hamming clustering problems. [Citation Graph (0, 0)][DBLP] J. Discrete Algorithms, 2004, v:2, n:2, pp:289-301 [Journal]
- Jesper Jansson, Nguyen Bao Nguyen, Wing-Kin Sung
Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2006, v:35, n:5, pp:1098-1121 [Journal]
- Charles Choy, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
Computing the maximum agreement of phylogenetic networks. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:335, n:1, pp:93-107 [Journal]
- Jesper Jansson, Wing-Kin Sung
Inferring a level-1 phylogenetic network from a dense set of rooted triplets. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:363, n:1, pp:60-68 [Journal]
- Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree. [Citation Graph (0, 0)][DBLP] AAIM, 2007, pp:167-177 [Conf]
- Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
Ultra-succinct representation of ordered trees. [Citation Graph (0, 0)][DBLP] SODA, 2007, pp:575-584 [Conf]
- Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. [Citation Graph (0, 0)][DBLP] Algorithmica, 2007, v:48, n:3, pp:233-248 [Journal]
On the Approximability of Maximum and Minimum Edge Clique Partition Problems. [Citation Graph (, )][DBLP]
Inferring Ordered Trees from Local Constraints. [Citation Graph (, )][DBLP]
Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. [Citation Graph (, )][DBLP]
Constructing the R* Consensus Tree of Two Trees in Subcubic Time. [Citation Graph (, )][DBLP]
Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. [Citation Graph (, )][DBLP]
Graph orientation to maximize the minimum weighted outdegree. [Citation Graph (, )][DBLP]
New Results on Optimizing Rooted Triplets Consistency. [Citation Graph (, )][DBLP]
Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets. [Citation Graph (, )][DBLP]
More Efficient Periodic Traversal in Anonymous Undirected Graphs. [Citation Graph (, )][DBLP]
Linear-Time Protein 3-D Structure Searching with Insertions and Deletions. [Citation Graph (, )][DBLP]
The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree. [Citation Graph (, )][DBLP]
Approximation Algorithms for Buy-at-Bulk Geometric Network Design. [Citation Graph (, )][DBLP]
More efficient periodic traversal in anonymous undirected graphs [Citation Graph (, )][DBLP]
New results on optimizing rooted triplets consistency. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.305secs
|