( en | de | ru )

 

Disambiguation of "Eulenstein, Oliver"

Author of the publication

copydeleteadd this publication to your clipboard
Flipping: A supertree construction method.

, , , , and . Bioconsensus, volume 61 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 135-160. DIMACS/AMS, (2001)

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.

Oliver Eulenstein

Frank Eulenstein

Elisabeth Eulenstein

Michael Eulenstein

Silke Eulenstein

 

Other publications of authors with the same name

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