( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Maximum parsimony reconciliation in the DTLOR model.

, , , , , и . BMC Bioinform., 22 (10): 394 (2021)

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.

Ran Ran

Edith Hadaschik

Marie-Luisa Hadaschik

Boris Alexander Hadaschik

Kerstin Hadasch

 

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

A first course in computing with applications to biology., и . Briefings Bioinform., 14 (5): 610-617 (2013)Optimal Contention-Free Unicast-Based Multicasting in Switch-Based Networks of Workstations., , и . IPPS/SPDP, стр. 358-364. IEEE Computer Society, (1998)Solutions to the Module Orientation and Rotation Problems by Neural Computation Networks., и . DAC, стр. 400-405. ACM Press, (1989)Maximum parsimony reconciliation in the DTLOR model., , , , , и . BMC Bioinform., 22 (10): 394 (2021)Efficient collective communication in WDM networks with a power budget.. ICCCN, стр. 612-616. IEEE, (2000)Multicast virtual topologies in WDM paths and rings with splitting loss., , , , и . ICCCN, стр. 318-321. IEEE, (2002)When CS 1 is biology 1: crossdisciplinary collaboration as CS context., , и . ITiCSE, стр. 219-223. ACM, (2010)A derivation-first approach to teaching algorithms.. SIGCSE, стр. 573-578. ACM, (2013)An efficient exact algorithm for computing all pairwise distances between reconciliations in the duplication-transfer-loss model., , и . BMC Bioinform., 20-S (20): 636 (2019)DTL-RnB: Algorithms and Tools for Summarizing the Space of DTL Reconciliations., , , , , , и . IEEE ACM Trans. Comput. Biol. Bioinform., 15 (2): 411-421 (2018)