| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente |
Faster computation of the Robinson-Foulds distance between phylogenetic networks.  |
Inf. Sci.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tatsuya Akutsu, Daiji Fukagawa, Jesper Jansson, Kunihiko Sadakane |
Inferring a graph from path frequency.  |
Discrete Applied Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung |
Ultra-succinct representation of ordered trees with applications.  |
J. Comput. Syst. Sci.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson, Richard S. Lemence, Andrzej Lingas |
The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree.  |
SIAM J. Comput.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung |
Fast Relative Lempel-Ziv Self-index for Similar Sequences.  |
FAW-AAIM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo |
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree.  |
J. Comb. Optim.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | José Carlos Clemente, Jesper Jansson, Gabriel Valiente |
Flexible taxonomic assignment of ambiguous sequencing reads.  |
BMC Bioinformatics  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono |
Graph Orientation to Maximize the Minimum Weighted Outdegree.  |
Int. J. Found. Comput. Sci.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson, Zeshan Peng |
Algorithms for Finding a Most Similar Subforest.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung |
Computing a Smallest Multilabeled Phylogenetic Tree from Rooted Triplets.  |
IEEE/ACM Trans. Comput. Biology Bioinform.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yun Cui, Jesper Jansson, Wing-Kin Sung |
Algorithms for Building Consensus MUL-trees.  |
ISAAC  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung |
Compressed random access memory  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson |
New results on optimizing rooted triplets consistency.  |
Discrete Applied Mathematics  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson, Wing-Kin Sung |
Constructing the R* Consensus Tree of Two Trees in Subcubic Time.  |
ESA  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | José Carlos Clemente, Jesper Jansson, Gabriel Valiente |
Accurate Taxonomic Assignment of Short Pyrosequencing Reads.  |
Pacific Symposium on Biocomputing  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Jesper Jansson, Richard S. Lemence, Andrzej Lingas |
The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree.  |
WABI  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente |
Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks.  |
CPM  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono |
Graph orientation to maximize the minimum weighted outdegree.  |
IPDPS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski |
Approximation Algorithms for Buy-at-Bulk Geometric Network Design.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane |
Linear-Time Protein 3-D Structure Searching with Insertions and Deletions.  |
WABI  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung |
Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets.  |
ISAAC  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson |
Directed Perfect Phylogeny (Binary Characters).  |
Encyclopedia of Algorithms  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson |
Perfect Phylogeny (Bounded Number of States).  |
Encyclopedia of Algorithms  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson |
Phylogenetic Tree Construction from a Distance Matrix.  |
Encyclopedia of Algorithms  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson |
New Results on Optimizing Rooted Triplets Consistency.  |
ISAAC  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson, Zeshan Peng |
Online and Dynamic Recognition of Squarefree Strings.  |
Int. J. Found. Comput. Sci.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell |
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem.  |
Algorithmica  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung |
Ultra-succinct representation of ordered trees.  |
SODA  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo |
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree.  |
AAIM  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung |
Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space.  |
FSTTCS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson, Wing-Kin Sung |
Inferring a level-1 phylogenetic network from a dense set of rooted triplets.  |
Theor. Comput. Sci.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson, Ngo Trung Hieu, Wing-Kin Sung |
Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs.  |
Journal of Computational Biology  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ying-Jun He, Trinh N. D. Huynh, Jesper Jansson, Wing-Kin Sung |
Inferring Phylogenetic Relationships Avoiding Forbidden Rooted Triplets.  |
J. Bioinformatics and Computational Biology  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson, Nguyen Bao Nguyen, Wing-Kin Sung |
Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network.  |
SIAM J. Comput.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson |
On the Approximability of Maximum and Minimum Edge Clique Partition Problems.  |
CATS  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Jesper Jansson, Zeshan Peng |
Algorithms for Finding a Most Similar Subforest.  |
CPM  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles Choy, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung |
Computing the maximum agreement of phylogenetic networks.  |
Theor. Comput. Sci.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung |
Rooted Maximum Agreement Supertrees.  |
Algorithmica  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson, Nguyen Bao Nguyen, Wing-Kin Sung |
Algorithms for combining rooted triplets into a galled phylogenetic network.  |
SODA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ho-Leung Chan, Jesper Jansson, Tak Wah Lam, Siu-Ming Yiu |
Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix.  |
MFCS  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson, Zeshan Peng |
Online and Dynamic Recognition of Squarefree Strings.  |
MFCS  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ying-Jun He, Trinh N. D. Huynh, Jesper Jansson, Wing-Kin Sung |
Inferring phylogenetic relationships avoiding forbidden rooted triplets.  |
APBC  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Stefan Dobrev, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung |
Finding Short Right-Hand-on-the-Wall Walks in Graphs.  |
SIROCCO  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Trinh N. D. Huynh, Jesper Jansson, Nguyen Bao Nguyen, Wing-Kin Sung |
Constructing a Smallest Refining Galled Phylogenetic Network.  |
RECOMB  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles Choy, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung |
Computing the Maximum Agreement of Phylogenetic Networks.  |
Electr. Notes Theor. Comput. Sci.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson, Takeshi Tokuyama |
Semi-Balanced Colorings of Graphs: Generalized 2-Colorings Based on a Relaxed Discrepancy Condition.  |
Graphs and Combinatorics  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Leszek Gasieniec, Jesper Jansson, Andrzej Lingas |
Approximation algorithms for Hamming clustering problems.  |
J. Discrete Algorithms  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung |
Rooted Maximum Agreement Supertrees.  |
LATIN  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell |
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem.  |
CPM  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson, Wing-Kin Sung |
Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets.  |
COCOON  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson, Wing-Kin Sung |
The Maximum Agreement of Two Nested Phylogenetic Networks.  |
ISAAC  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson, Ngo Trung Hieu, Wing-Kin Sung |
Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs.  |
ISAAC  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson, Andrzej Lingas |
A Fast Algorithm for Optimal Alignment between Similar Ordered Trees.  |
Fundam. Inform.  |
2003 |
DBLP BibTeX RDF |
|
| 1 | Jesper Jansson |
On the Complexity of Inferring Rooted Evolutionary Trees.  |
Electronic Notes in Discrete Mathematics  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson, Andrzej Lingas |
A Fast Algorithm for Optimal Alignment between Similar Ordered Trees.  |
CPM  |
2001 |
DBLP BibTeX RDF |
|
| 1 | Leszek Gasieniec, Jesper Jansson, Andrzej Lingas |
Approximation Algorithms for Hamming Clustering Problems.  |
CPM  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin |
On the Complexity of Constructing Evolutionary Trees.  |
J. Comb. Optim.  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Leszek Gasieniec, Jesper Jansson, Andrzej Lingas |
Efficient Approximation Algorithms for the Hamming Center Problem.  |
SODA  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin |
Inferring Ordered Trees from Local Constraints.  |
CATS  |
1998 |
DBLP BibTeX RDF |
|
| 1 | Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin |
On the Complexity of Computing Evolutionary Trees.  |
COCOON  |
1997 |
DBLP DOI BibTeX RDF |
|