![]() | ![]() |
| 2012 | ||
|---|---|---|
| 68 | Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung: Fast Relative Lempel-Ziv Self-index for Similar Sequences. FAW-AAIM 2012: 291-302 | |
| 67 | 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 | |
| 66 | Tatsuya Akutsu, Daiji Fukagawa, Jesper Jansson, Kunihiko Sadakane: Inferring a graph from path frequency. Discrete Applied Mathematics 160(10-11): 1416-1428 (2012) | |
| 65 | 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) | |
| 64 | Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung: Ultra-succinct representation of ordered trees with applications. J. Comput. Syst. Sci. 78(2): 619-631 (2012) | |
| 63 | Jesper Jansson, Richard S. Lemence, Andrzej Lingas: The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree. SIAM J. Comput. 41(1): 272-291 (2012) | |
| 2011 | ||
| 62 | Yun Cui, Jesper Jansson, Wing-Kin Sung: Algorithms for Building Consensus MUL-trees. ISAAC 2011: 744-753 | |
| 61 | José Carlos Clemente, Jesper Jansson, Gabriel Valiente: Flexible taxonomic assignment of ambiguous sequencing reads. BMC Bioinformatics 12: 8 (2011) | |
| 60 | 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) | |
| 59 | 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) | |
| 58 | 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) | |
| 57 | 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) | |
| 56 | Jesper Jansson, Zeshan Peng: Algorithms for Finding a Most Similar Subforest. Theory Comput. Syst. 48(4): 865-887 (2011) | |
| 2010 | ||
| 55 | Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente: Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. CPM 2010: 190-201 | |
| 54 | Jesper Jansson, Wing-Kin Sung: Constructing the R* Consensus Tree of Two Trees in Subcubic Time. ESA (1) 2010: 573-584 | |
| 53 | José Carlos Clemente, Jesper Jansson, Gabriel Valiente: Accurate Taxonomic Assignment of Short Pyrosequencing Reads. Pacific Symposium on Biocomputing 2010: 3-9 | |
| 52 | Jesper Jansson, Richard S. Lemence, Andrzej Lingas: The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree. WABI 2010: 262-273 | |
| 51 | Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung: Compressed random access memory CoRR abs/1011.1708: (2010) | |
| 50 | Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson: New results on optimizing rooted triplets consistency. Discrete Applied Mathematics 158(11): 1136-1147 (2010) | |
| 2009 | ||
| 49 | Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono: Graph orientation to maximize the minimum weighted outdegree. IPDPS 2009: 1-8 | |
| 48 | Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung: Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets. ISAAC 2009: 1205-1214 | |
| 47 | 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 | |
| 46 | Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane: Linear-Time Protein 3-D Structure Searching with Insertions and Deletions. WABI 2009: 310-320 | |
| 45 | 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 | |
| 44 | 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 | ||
| 43 | Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson: New Results on Optimizing Rooted Triplets Consistency. ISAAC 2008: 484-495 | |
| 42 | Jesper Jansson: Directed Perfect Phylogeny (Binary Characters). Encyclopedia of Algorithms 2008 | |
| 41 | Jesper Jansson: Perfect Phylogeny (Bounded Number of States). Encyclopedia of Algorithms 2008 | |
| 40 | Jesper Jansson: Phylogenetic Tree Construction from a Distance Matrix. Encyclopedia of Algorithms 2008 | |
| 2007 | ||
| 39 | 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 | 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 | Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung: Ultra-succinct representation of ordered trees. SODA 2007: 575-584 | |
| 36 | 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 | 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 | Jesper Jansson, Zeshan Peng: Online and Dynamic Recognition of Squarefree Strings. Int. J. Found. Comput. Sci. 18(2): 401-414 (2007) | |
| 2006 | ||
| 33 | 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 | Jesper Jansson, Zeshan Peng: Algorithms for Finding a Most Similar Subforest. CPM 2006: 377-388 | |
| 31 | 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 | 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 | 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 | 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 | 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 | 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 | Ying-Jun He, Trinh N. D. Huynh, Jesper Jansson, Wing-Kin Sung: Inferring phylogenetic relationships avoiding forbidden rooted triplets. APBC 2005: 339-348 | |
| 24 | 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 | Jesper Jansson, Zeshan Peng: Online and Dynamic Recognition of Squarefree Strings. MFCS 2005: 520-531 | |
| 22 | Trinh N. D. Huynh, Jesper Jansson, Nguyen Bao Nguyen, Wing-Kin Sung: Constructing a Smallest Refining Galled Phylogenetic Network. RECOMB 2005: 265-280 | |
| 21 | Stefan Dobrev, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung: Finding Short Right-Hand-on-the-Wall Walks in Graphs. SIROCCO 2005: 127-139 | |
| 20 | Jesper Jansson, Nguyen Bao Nguyen, Wing-Kin Sung: Algorithms for combining rooted triplets into a galled phylogenetic network. SODA 2005: 349-358 | |
| 19 | Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung: Rooted Maximum Agreement Supertrees. Algorithmica 43(4): 293-307 (2005) | |
| 18 | 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 | Jesper Jansson, Wing-Kin Sung: Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets. COCOON 2004: 462-472 | |
| 16 | Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell: Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. CPM 2004: 220-229 | |
| 15 | 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 | Jesper Jansson, Wing-Kin Sung: The Maximum Agreement of Two Nested Phylogenetic Networks. ISAAC 2004: 581-593 | |
| 13 | Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung: Rooted Maximum Agreement Supertrees. LATIN 2004: 499-508 | |
| 12 | 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 | 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 | 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 | Leszek Gasieniec, Jesper Jansson, Andrzej Lingas: Approximation algorithms for Hamming clustering problems. J. Discrete Algorithms 2(2): 289-301 (2004) | |
| 2003 | ||
| 8 | Jesper Jansson, Andrzej Lingas: A Fast Algorithm for Optimal Alignment between Similar Ordered Trees. Fundam. Inform. 56(1-2): 105-120 (2003) | |
| 2001 | ||
| 7 | Jesper Jansson, Andrzej Lingas: A Fast Algorithm for Optimal Alignment between Similar Ordered Trees. CPM 2001: 232-240 | |
| 6 | Jesper Jansson: On the Complexity of Inferring Rooted Evolutionary Trees. Electronic Notes in Discrete Mathematics 7: 50-53 (2001) | |
| 2000 | ||
| 5 | Leszek Gasieniec, Jesper Jansson, Andrzej Lingas: Approximation Algorithms for Hamming Clustering Problems. CPM 2000: 108-118 | |
| 1999 | ||
| 4 | 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 | |
Colors in the list of coauthors
Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page