Rchr
J-GLOBAL ID：201401012105964630
Update date: Aug. 31, 2020
Jansson Jesper
Jansson Jesper
Contact this researcher
You can send email directly to the researcher.
Affiliation and department：
Kyoto University
About Kyoto University
Search "Kyoto University"
Papers (56)：
Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung. Fast relative Lempel-Ziv self-index for similar sequences. THEORETICAL COMPUTER SCIENCE. 2014. 532. 14-30
Jesper Jansson, Andrzej Lingas. Computing the rooted triplet distance between galled trees by counting triangles. Journal of Discrete Algorithms. 2014. 25. 66-78
Jesper Jansson, Wing-Kin Sung. Constructing the R* Consensus Tree of Two Trees in Subcubic Time. ALGORITHMICA. 2013. 66. 2. 329-345
J. Jansson, K. Sadakane, W.-K. Sung. Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. Algorithmica. 2013. 1-20
Jesper Jansson. Editorial: Special issue on graph algorithms. Algorithms. 2013. 6. 3. 457-458
ｍore...
MISC (4)：
J. Jansson, C. Shen, W.-K. Sung. Improved algorithms for constructing consensus trees. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. 2013. 1800-1813
Y. Asahiro, J. Jansson, E. Miyano, H. Ono. Upper and lower degree bounded graph orientation with minimum penalty. Conferences in Research and Practice in Information Technology Series. 2012. 128. 139-146
Jose C. Clemente, Jesper Jansson, Gabriel Valiente. ACCURATE TAXONOMIC ASSIGNMENT OF SHORT PYROSEQUENCING READS. PACIFIC SYMPOSIUM ON BIOCOMPUTING 2010. 2010. 3-9
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas. Efficient approximation algorithms for the Hamming center problem. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. 1999. S905-S906
※ Researcher’s information displayed in J-GLOBAL is based on the information registered in
researchmap
.
For details, see here
.
Return to Previous Page
TOP
BOTTOM
