The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Jesper Jansson" ( http://dblp.L3S.de/Authors/Jesper_Jansson )

URL (Homepage):  http://sunflower.kuicr.kyoto-u.ac.jp/~jj/  Author page on DBLP  Author page in RDF  Community of Jesper Jansson in ASPL-2

Publication years (Num. hits)
1997-2004 (17) 2005-2006 (16) 2007-2009 (16) 2010-2012 (19)
Publication types (Num. hits)
article(30) incollection(3) inproceedings(35)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

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