PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "van Iersel, Leo"

Author of the publication

copydeleteadd this publication to your clipboard
Rooting for phylogenetic networks.

, , , , , , and . CoRR, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dr. phil. Leo van Waveren University of Stuttgart

Christian León University of Stuttgart

Sebastian Leopoldus University of Stuttgart

apl. Prof. Dr. -Ing. Klaus Leonhardt University of Stuttgart

Nina van den Daele University of Stuttgart

 

Other publications of authors with the same name

Constructing Level-2 Phylogenetic Networks from Triplets., , , , , and . IEEE/ACM Trans. Comput. Biology Bioinform., 6 (4): 667-681 (2009)A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees., , , and . BMC Bioinformatics, (2014)A Practical Algorithm for Reconstructing Level-1 Phylogenetic Networks., , , and . IEEE/ACM Trans. Comput. Biology Bioinform., 8 (3): 635-649 (2011)On unrooted and root-uncertain variants of several well-known phylogenetic network problems., , , , and . CoRR, (2016)Finding the most parsimonious or likely tree in a network with respect to an alignment., , , and . CoRR, (2017)Uniqueness, Intractability and Exact Algorithms: Reflections on Level-k Phylogenetic Networks., , and . J. Bioinformatics and Computational Biology, 7 (4): 597-623 (2009)Rearrangement moves on rooted phylogenetic networks., , , , , and . PLoS Computational Biology, (2017)Polynomial-Time Algorithms for Phylogenetic Inference Problems., , , , and . AlCoB, volume 10849 of Lecture Notes in Computer Science, page 37-49. Springer, (2018)On the Complexity of Several Haplotyping Problems., , , and . WABI, volume 3692 of Lecture Notes in Computer Science, page 128-139. Springer, (2005)Constructing the Simplest Possible Phylogenetic Network from Triplets., and . Algorithmica, 60 (2): 207-235 (2011)