( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance.

, , и . CoRR, (2022)

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.

Simone Linz

Friedel Linz

Ekkehard Linz

Stefan Linz

Gerhard Linz

 

Другие публикации лиц с тем же именем

Deciding the existence of a cherry-picking sequence is hard on two trees., , , и . Discret. Appl. Math., (2019)Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees., , , и . CoRR, (2014)Reflections on kernelizing and computing unrooted agreement forests., , , и . Ann. Oper. Res., 309 (1): 425-451 (2022)Display Sets of Normal and Tree-Child Networks., , и . Electron. J. Comb., 28 (1): 1 (2021)Optimizing tree and character compatibility across several phylogenetic trees., , и . Theor. Comput. Sci., (2013)Autumn Algorithm - Computation of Hybridization Networks for Realistic Phylogenetic Trees., и . IEEE ACM Trans. Comput. Biol. Bioinform., 15 (2): 398-410 (2018)Hypercubes and Hamiltonian Cycles of Display Sets of Rooted Phylogenetic Networks., , и . CoRR, (2022)On the Subnet Prune and Regraft Distance., и . CoRR, (2018)Algorithms and Complexity in Phylogenetics (Dagstuhl Seminar 19443)., , , и . Dagstuhl Reports, 9 (10): 134-151 (2019)Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set., , , , , и . SIAM J. Discret. Math., 26 (4): 1635-1656 (2012)