( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Algorithms for Knowledge-Enhanced Supertrees.

, , и . ISBRA, том 7292 из Lecture Notes in Computer Science, стр. 263-274. Springer, (2012)

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.

Oliver Eulenstein

Elisabeth Eulenstein

Frank Eulenstein

Michael Eulenstein

Silke Eulenstein

 

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

Manhattan Path-Difference Median Trees., и . BCB, стр. 404-413. ACM, (2016)Robinson-Foulds Reticulation Networks., , , и . BCB, стр. 77-86. ACM, (2019)Efficient error correction algorithms for gene tree reconciliation based on duplication, duplication and loss, and deep coalescence., , и . BMC Bioinform., 13 (S-10): S11 (2012)GTP Supertrees from Unrooted Gene Trees: Linear Time Algorithms for NNI Based Local Searches., , и . ISBRA, том 7292 из Lecture Notes in Computer Science, стр. 102-114. Springer, (2012)Solving the Gene Duplication Feasibility Problem in Linear Time., , и . COCOON, том 10976 из Lecture Notes in Computer Science, стр. 378-390. Springer, (2018)Guest editors' introduction to the Proceedings of the 9th International Symposium on Biomedical Research and Applications., , и . BMC Bioinform., 15 (S-13): S1 (2014)Scalable and Extensible Robinson-Foulds for Comparative Phylogenetics., , , , и . IPDPS Workshops, стр. 166-175. IEEE, (2022)Integer Linear Programming Formulation for the Unified Duplication-Loss-Coalescence Model., , , и . ISBRA, том 12304 из Lecture Notes in Computer Science, стр. 229-242. Springer, (2020)Cluster Matching Distance for Rooted Phylogenetic Trees., и . ISBRA, том 10847 из Lecture Notes in Computer Science, стр. 321-332. Springer, (2018)Feasibility Algorithms for the Duplication-Loss Cost., , и . COCOON, том 11653 из Lecture Notes in Computer Science, стр. 206-218. Springer, (2019)