Jansson Publications of Jesper Jansson     Order by:   Type | Year
Associated keywords
2019
1
photophoto
Jesper Jansson, Konstantinos Mampentzidis, Ramesh Rajaby and Wing-Kin Sung. Computing the Rooted Triplet Distance Between Phylogenetic Networks. In IWOCA19, Vol. 11638:290-303 of LNCS, Springer, 2019.
Keywords: distance between networks, from network, phylogenetic network, phylogeny, polynomial, triplet distance.
       

2017
2
photophoto
Jesper Jansson, Ramesh Rajaby and Wing-Kin Sung. An Efficient Algorithm for the Rooted Triplet Distance Between Galled Trees. In AlCoB17, Vol. 10252:115-126 of LNCS, Springer, 2017.
Keywords: distance between networks, from network, phylogenetic network, phylogeny, polynomial, reconstruction, triplet distance.
Note: .
       

2014
3
photophoto
Jesper Jansson and Andrzej Lingas. Computing the rooted triplet distance between galled trees by counting triangles. In Journal of Discrete Algorithms, Vol. 25:66-78, 2014.
Keywords: distance between networks, explicit network, from network, galled network, phylogenetic network, phylogeny, polynomial, triplet distance.
       
Toggle abstract
2012
4
photophotophotophotophoto
An-Chiang Chu, Jesper Jansson, Richard Lemence, Alban Mancheron and Kun-Mao Chao. Asymptotic Limits of a New Type of Maximization Recurrence with an Application to Bioinformatics. In TAMC12, Vol. 7287:177-188 of LNCS, springer, 2012.
Keywords: from triplets, galled network, level k phylogenetic network, phylogenetic network.
Note: preliminary version.
       
Toggle abstract
5
photophoto
Jesper Jansson and Andrzej Lingas. Computing the rooted triplet distance between galled trees by counting triangles. In CPM12, Vol. 7354:385-398 of LNCS, springer, 2012.
Keywords: distance between networks, explicit network, from network, galled tree, phylogenetic network, phylogeny, polynomial, triplet distance.
Note: http://www.df.lth.se/~jj/Publications/d_rt_for_Galled_Trees5_CPM_2012.pdf.
       
Toggle abstract
6
photophotophotophotophoto
Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara and Gabriel Valiente. Faster computation of the Robinson–Foulds distance between phylogenetic networks. In Information Sciences, Vol. 197:77-90, 2012.
Keywords: distance between networks, explicit network, level k phylogenetic network, phylogenetic network, polynomial, spread.
       
Toggle abstract
2010
7
photophotophotophotophoto
Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara and Gabriel Valiente. Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. In CPM10, Vol. 6129:190-201 of LNCS, springer, 2010.
Keywords: distance between networks, explicit network, level k phylogenetic network, phylogenetic network, polynomial, spread.
Note: http://hdl.handle.net/10119/9859, slides available at http://cs.nyu.edu/parida/CPM2010/MainPage_files/18.pdf.
       
Toggle abstract
2008
8
photophoto
Jesper Jansson and Wing-Kin Sung. The Maximum Agreement of Two Nested Phylogenetic Networks. In Oleg N. Terikhovsky and William N. Burton editors, New Topics in Theoretical Computer Science, Pages 119-141, Nova Publishers, 2008.
Keywords: dynamic programming, MASN, nested network, phylogenetic network, phylogeny, polynomial.
Note: http://www.df.lth.se/~jj/Publications/nested12_NTTCS2008_corrected.pdf.
       

2006
9
photophotophotophoto
Ho-Leung Chan, Jesper Jansson, Tak-Wah Lam and Siu-Ming Yiu. Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix. In JBCB, Vol. 4(4):807-832, 2006.
Keywords: explicit network, from distances, galled tree, phylogenetic network, phylogeny, polynomial, reconstruction.
Note: http://www.df.lth.se/~jj/Publications/dist_ugn7_JBCB2006.pdf.
       
Toggle abstract
10
photophotophoto
Jesper Jansson, Nguyen Bao Nguyen and Wing-Kin Sung. Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network. In SICOMP, Vol. 35(5):1098-1121, 2006.
Keywords: approximation, explicit network, from triplets, galled tree, phylogenetic network, phylogeny, polynomial, reconstruction.
Note: http://www.df.lth.se/~jj/Publications/triplets_to_gn7_SICOMP2006.pdf.
       
Toggle abstract
11
photophoto
Jesper Jansson and Wing-Kin Sung. Inferring a level-1 phylogenetic network from a dense set of rooted triplets. In TCS, Vol. 363(1):60-68, 2006.
Keywords: explicit network, from triplets, galled tree, level k phylogenetic network, phylogenetic network, phylogeny, polynomial, reconstruction.
Note: http://www.df.lth.se/~jj/Publications/ipnrt8_TCS2006.pdf.
       
Toggle abstract
12
photophotophotophoto
Ying-Jun He, Trinh N. D. Huynh, Jesper Jansson and Wing-Kin Sung. Inferring Phylogenetic Relationships Avoiding Forbidden Rooted Triplets. In JBCB, Vol. 4(1):59-74, 2006.
Note: http://www.df.lth.se/~jj/Publications/forb_triplets7_JBCB2006.pdf.
       
Toggle abstract
2005
13
photophotophotophoto
Charles Choy, Jesper Jansson, Kunihiko Sadakane and Wing-Kin Sung. Computing the maximum agreement of phylogenetic networks. In TCS, Vol. 335(1):93-107, 2005.
Keywords: dynamic programming, FPT, level k phylogenetic network, MASN, NP complete, phylogenetic network, phylogeny.
Note: http://www.df.lth.se/~jj/Publications/masn8_TCS2005.pdf.
       
Toggle abstract
14
photophotophotophoto
Ho-Leung Chan, Jesper Jansson, Tak-Wah Lam and Siu-Ming Yiu. Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix. In MFCS05, Vol. 3618:224-235 of LNCS, springer, 2005.
Keywords: from distances, galled tree, phylogenetic network, phylogeny, reconstruction.
Note: http://dx.doi.org/10.1007/11549345_20.
       

15
photophotophoto
Jesper Jansson, Nguyen Bao Nguyen and Wing-Kin Sung. Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network. In SODA05, Pages 349-358, 2005.
Keywords: approximation, explicit network, from triplets, galled tree, phylogenetic network, phylogeny, polynomial, reconstruction.
Note: http://portal.acm.org/citation.cfm?id=1070481.
       

16
photophoto
Jesper Jansson and Wing-Kin Sung. The Maximum Agreement of Two Nested Phylogenetic Networks. In ISAAC04, Vol. 3341:581-593 of LNCS, springer, 2005.
Keywords: dynamic programming, MASN, nested network, NP complete, phylogenetic network, phylogeny, polynomial.
Note: http://www.df.lth.se/~jj/Publications/nested7_ISAAC2004.pdf.
       

17
photophotophotophoto
Trinh N. D. Huynh, Jesper Jansson, Nguyen Bao Nguyen and Wing-Kin Sung. Constructing a Smallest Refining Galled Phylogenetic Network. In RECOMB05, Vol. 3500:265-280 of LNCS, springer, 2005.
Keywords: from rooted trees, galled tree, NP complete, phylogenetic network, phylogeny, polynomial, Program SPNet, reconstruction.
Note: http://www.df.lth.se/~jj/Publications/refining_gn3_RECOMB2005.pdf.
       

18
photophotophotophoto
Ying-Jun He, Trinh N. D. Huynh, Jesper Jansson and Wing-Kin Sung. Inferring Phylogenetic Relationships Avoiding Forbidden Rooted Triplets. In APBC05, Pages 339-348, 2005.
Note: https://dflund.se/~jj/Publications/forb_triplets4_APBC2005.pdf.
       

2004
19
photophotophotophoto
Charles Choy, Jesper Jansson, Kunihiko Sadakane and Wing-Kin Sung. Computing the maximum agreement of phylogenetic networks. In Proceedings of Computing: the Tenth Australasian Theory Symposium (CATS'04), Vol. 91:134-147 of Electronic Notes in Theoretical Computer Science, 2004.
Keywords: dynamic programming, FPT, level k phylogenetic network, MASN, NP complete, phylogenetic network, phylogeny.
Note: http://www.df.lth.se/~jj/Publications/masn6_CATS2004.pdf.
       
Toggle abstract
20
photophoto
Jesper Jansson and Wing-Kin Sung. Inferring a level-1 phylogenetic network from a dense set of rooted triplets. In COCOON04, Vol. 3106:462-471 of LNCS, springer, 2004.
Keywords: explicit network, from triplets, galled tree, level k phylogenetic network, phylogenetic network, phylogeny, polynomial, reconstruction.
Note: http://www.df.lth.se/~jj/Publications/ipnrt6_COCOON2004.pdf.