Publications related to 'Program Marlon' : MARLON (Minimum Amount of Reticulation Level One Network) is a program which reconstructs a level-1 phylogenetic network (i.e. galled tree), with the minimum number of reticulation nodes, from a set of triplets. Available at http://skelk.sdf-eu.org/marlon.html.
 
Order by:   Type | Year
           related to:
Associated keywords
2011
1
photophoto
Leo van Iersel and Steven Kelk. Constructing the Simplest Possible Phylogenetic Network from Triplets. In ALG, Vol. 60(2):207-235, 2011.
Keywords: explicit network, from triplets, galled tree, level k phylogenetic network, minimum number, phylogenetic network, phylogeny, polynomial, Program Marlon, Program Simplistic.
Note: http://dx.doi.org/10.1007/s00453-009-9333-0.
       
Toggle abstract
2009
2
photo
Leo van Iersel. Algorithms, Haplotypes and Phylogenetic Networks. PhD thesis, Eindhoven University of Technology, The Netherlands, 2009.
Keywords: evaluation, explicit network, exponential algorithm, FPT, from triplets, galled tree, level k phylogenetic network, mu distance, phylogenetic network, phylogeny, polynomial, Program Level2, Program Marlon, Program Simplistic, Program T REX, reconstruction.
Note: http://www.win.tue.nl/~liersel/thesis_vaniersel_viewing.pdf.
       

2008
3
photophoto
Leo van Iersel and Steven Kelk. Constructing the Simplest Possible Phylogenetic Network from Triplets. In ISAAC08, Vol. 5369:472-483 of LNCS, springer, 2008.
Keywords: explicit network, from triplets, galled tree, level k phylogenetic network, minimum number, phylogenetic network, phylogeny, polynomial, Program Marlon, Program Simplistic.
Note: http://arxiv.org/abs/0805.1859.