Healthcare robotics across home and hospital settings: innovations, challenges, and future prospects.

Oliver Eulenstein https://scholar.google.com/citations?user=HWF6UxgAAAAJ https://zbmath.org/authors/?q=ai:eulenstein.oliver https://mathscinet.ams.org/mathscinet/MRAuthorID/630012 https://mathgenealogy.org/id.php?id=171091 https://orcid.org/0000-0002-5291-3798 https://www.wikidata.org/entity/Q84105099 https://id.loc.gov/authorities/names/nb2013011441

Fulayjan Alanazi Ashraf Gaffar Oliver Eulenstein Healthcare robotics across home and hospital settings: innovations, challenges, and future prospects. 2026 e3659 12 PeerJ Comput. Sci. https://doi.org/10.7717/peerj-cs.3659 db/journals/peerj-cs/peerj-cs12.html#AlanaziGE26 streams/journals/peerj-cs

Sriram Vijendran Tavis K. Anderson Alexey Markin Oliver Eulenstein Phylo-rs: an extensible phylogenetic analysis library in rust. 197 2025 December 26 BMC Bioinform. 1 https://doi.org/10.1186/s12859-025-06234-w db/journals/bmcbi/bmcbi26.html#VijendranAME25 streams/journals/bmcbi

Pawel Górecki 0001 Alexey Markin Sriram Vijendran Oliver Eulenstein Computing generalized cophenetic distances under all Lp norms: A near-linear time algorithmic framework. 1013069 2025 21 PLoS Comput. Biol. 6 https://doi.org/10.1371/journal.pcbi.1013069 db/journals/ploscb/ploscb21.html#GoreckiMVE25 streams/journals/ploscb

Adithya Kulkarni Mohna Chakraborty Oliver Eulenstein Qi Li 0012 Beyond Single Parsers: An Empirical Analysis of Dependency Parse Tree Aggregation. 362-374 2025 PAKDD (Workshops) https://doi.org/10.1007/978-981-96-8197-6_27 conf/pakdd/2025-w db/conf/pakdd/pakdd2025-w.html#KulkarniCEL25 streams/conf/pakdd

Sanket Wagle Alexey Markin Pawel Górecki 0001 Tavis K. Anderson Oliver Eulenstein Asymmetric Cluster-Based Measures for Comparative Phylogenetics. 312-327 2024 31 J. Comput. Biol. 4 https://doi.org/10.1089/cmb.2023.0338 db/journals/jcb/jcb31.html#WagleMGAE24

Ashraf Gaffar Mohamed Y. Selim Oliver Eulenstein Using Conceptual Blending to Teach Software Design Principles to Undergraduates. 1-7 2024 FIE https://doi.org/10.1109/FIE61694.2024.10893506 conf/fie/2024 db/conf/fie/fie2024.html#GaffarSE24

Adithya Kulkarni Oliver Eulenstein Qi Li 0012 Empirical Analysis for Unsupervised Universal Dependency Parse Tree Aggregation. 2024 abs/2403.19183 CoRR https://doi.org/10.48550/arXiv.2403.19183 db/journals/corr/corr2403.html#abs-2403-19183

Siddhant Grover Alexey Markin Tavis K. Anderson Oliver Eulenstein Phylogenetic diversity statistics for all clades in a phylogeny. 177-184 2023 39 Bioinform. Supplement-1 https://doi.org/10.1093/bioinformatics/btad263 db/journals/bioinformatics/bioinformatics39.html#GroverMAE23

Sanket Wagle Alexey Markin Pawel Górecki 0001 Tavis K. Anderson Oliver Eulenstein The Asymmetric Cluster Affinity Cost. 131-145 2023 RECOMB-CG https://doi.org/10.1007/978-3-031-36911-7_9 conf/recombcg/2023 db/conf/recombcg/recombcg2023.html#WagleMGAE23

Alexey Markin Sanket Wagle Tavis K. Anderson Oliver Eulenstein RF-Net 2: fast inference of virus reassortment and hybridization networks. 2144-2152 2022 38 Bioinform. 8 https://doi.org/10.1093/bioinformatics/btac075 db/journals/bioinformatics/bioinformatics38.html#MarkinWAE22

Alvin Chon Pawel Górecki 0001 Oliver Eulenstein Xiaoqiu Huang 0001 Ali Jannesari Scalable and Extensible Robinson-Foulds for Comparative Phylogenetics. 166-175 2022 IPDPS Workshops https://doi.org/10.1109/IPDPSW55747.2022.00041 conf/ipps/2022w db/conf/ipps/ipdps2022w.html#ChonGEHJ22 Adithya Kulkarni Nasim Sabetpour Alexey Markin Oliver Eulenstein Qi Li 0012 CPTAM: Constituency Parse Tree Aggregation Method. 630-638 2022 SDM https://doi.org/10.1137/1.9781611977172.71 conf/sdm/2022 db/conf/sdm/sdm2022.html#KulkarniSME022

Adithya Kulkarni Nasim Sabetpour Alexey Markin Oliver Eulenstein Qi Li 0012 CPTAM: Constituency Parse Tree Aggregation Method. 2022 abs/2201.07905 CoRR https://arxiv.org/abs/2201.07905 db/journals/corr/corr2201.html#abs-2201-07905

Alexey Markin Oliver Eulenstein Quartet-based inference is statistically consistent under the unified duplication-loss-coalescence model. 4064-4074 2021 November 37 Bioinform. 22 https://doi.org/10.1093/bioinformatics/btab414 db/journals/bioinformatics/bioinformatics37.html#MarkinE21

Oliver Eulenstein Qin Ding 0001 Hisham Al-Mubaid Introduction to the JBCB Special Issue on Selected Papers from BICOB-2020. 2102001:1-2102001:2 2021 19 J. Bioinform. Comput. Biol. 1 https://doi.org/10.1142/S0219720021020017 db/journals/jbcb/jbcb19.html#Eulenstein0A21

Jaroslaw Paszek Alexey Markin Pawel Górecki 0001 Oliver Eulenstein Taming the Duplication-Loss-Coalescence Model with Integer Linear Programming. 758-773 2021 28 J. Comput. Biol. 8 https://doi.org/10.1089/cmb.2021.0011 db/journals/jcb/jcb28.html#PaszekM0E21

Pawel Tabaszewski Pawel Górecki 0001 Alexey Markin Tavis K. Anderson Oliver Eulenstein Consensus of All Solutions for Intractable Phylogenetic Tree Inference. 149-161 2021 18 IEEE ACM Trans. Comput. Biol. Bioinform. 1 https://doi.org/10.1109/TCBB.2019.2947051 https://www.wikidata.org/entity/Q90716137 db/journals/tcbb/tcbb18.html#TabaszewskiGMAE21

Pawel Górecki 0001 Oliver Eulenstein Jerzy Tiuryn The Unconstrained Diameters of the Duplication-Loss Cost and the Loss Cost. 2125-2135 2021 18 IEEE ACM Trans. Comput. Biol. Bioinform. 6 https://doi.org/10.1109/TCBB.2019.2919617 https://www.wikidata.org/entity/Q92440059 db/journals/tcbb/tcbb18.html#GoreckiET21

Jaroslaw Paszek Oliver Eulenstein Pawel Górecki 0001 Novel genomic duplication models through integer linear programming. 16:1-16:11 2021 BCB https://doi.org/10.1145/3459930.3469549 conf/bcb/2021 db/conf/bcb/bcb2021.html#PaszekE021

Huy N. Nguyen Alexey Markin Iddo Friedberg Oliver Eulenstein Finding orthologous gene blocks in bacteria: the computational hardness of the problem and novel methods to address it. i668-i674 2020 36 Bioinform. Supplement-2 https://doi.org/10.1093/bioinformatics/btaa794 https://www.wikidata.org/entity/Q104681778 db/journals/bioinformatics/bioinformatics36.html#NguyenMFE20

Javad Ansarifar Alexey Markin Pawel Górecki 0001 Oliver Eulenstein Integer Linear Programming Formulation for the Unified Duplication-Loss-Coalescence Model. 229-242 2020 ISBRA https://doi.org/10.1007/978-3-030-57821-3_20 conf/isbra/2020 db/conf/isbra/isbra2020.html#AnsarifarM0E20

Huy N. Nguyen Ashish Jain Oliver Eulenstein Iddo Friedberg Tracing the ancestry of operons in bacteria. 2998-3004 2019 35 Bioinform. 17 https://doi.org/10.1093/bioinformatics/btz053 https://www.wikidata.org/entity/Q62766221 db/journals/bioinformatics/bioinformatics35.html#NguyenJEF19

Pawel Górecki 0001 Agnieszka Mykowiecka 0002 Jaroslaw Paszek Oliver Eulenstein Mathematical properties of the gene duplication cost. 114-122 2019 258 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2018.11.014 https://www.wikidata.org/entity/Q128752372 db/journals/dam/dam258.html#GoreckiMPE19

Qin Ding 0001 Oliver Eulenstein Hisham Al-Mubaid Foreword: Special Issue for the 2019 International Conference on Bioinformatics and Computational Biology (BICOB-2019). 1902004:1-1902004:2 2019 17 J. Bioinform. Comput. Biol. 6 https://doi.org/10.1142/S0219720019020049 https://www.wikidata.org/entity/Q89530319 db/journals/jbcb/jbcb17.html#0001EA19

Alexey Markin Oliver Eulenstein Computing Manhattan Path-Difference Median Trees: A Practical Local Search Approach. 1063-1076 2019 16 IEEE ACM Trans. Comput. Biol. Bioinform. 4 https://doi.org/10.1109/TCBB.2017.2718507 https://www.wikidata.org/entity/Q38708833 db/journals/tcbb/tcbb16.html#MarkinE19

Alexey Markin Oliver Eulenstein Efficient Local Search for Euclidean Path-Difference Median Trees. 1374-1385 2019 16 IEEE ACM Trans. Comput. Biol. Bioinform. 4 https://doi.org/10.1109/TCBB.2017.2763137 https://www.wikidata.org/entity/Q46284695 db/journals/tcbb/tcbb16.html#MarkinE19a

Alexey Markin Oliver Eulenstein Cophenetic Median Trees. 1459-1470 2019 16 IEEE ACM Trans. Comput. Biol. Bioinform. 5 https://doi.org/10.1109/TCBB.2018.2870173 https://www.wikidata.org/entity/Q91482005 db/journals/tcbb/tcbb16.html#MarkinE19b

Alexey Markin Tavis K. Anderson Venkata Sai Krishna Teja Vadali Oliver Eulenstein Robinson-Foulds Reticulation Networks. 77-86 2019 BCB https://doi.org/10.1145/3307339.3342151 conf/bcb/2019 db/conf/bcb/bcb2019.html#MarkinAVE19 Pawel Górecki 0001 Alexey Markin Oliver Eulenstein Feasibility Algorithms for the Duplication-Loss Cost. 206-218 2019 COCOON https://doi.org/10.1007/978-3-030-26176-4_17 conf/cocoon/2019 db/conf/cocoon/cocoon2019.html#GoreckiME19 Jucheol Moon Oliver Eulenstein The Cluster Affinity Distance for Phylogenies. 52-64 2019 ISBRA https://doi.org/10.1007/978-3-030-20242-2_5 conf/isbra/2019 db/conf/isbra/isbra2019.html#MoonE19 Alexey Markin Oliver Eulenstein Consensus Clusters in Robinson-Foulds Reticulation Networks. 12:1-12:12 2019 WABI https://doi.org/10.4230/LIPIcs.WABI.2019.12 conf/wabi/2019 db/conf/wabi/wabi2019.html#MarkinE19

Hisham Al-Mubaid Qin Ding 0001 Oliver Eulenstein Introduction to JBCB Special Issue on BICOB-2018. 1802004:1-1802004:3 2018 16 J. Bioinform. Comput. Biol. 5 https://doi.org/10.1142/S0219720018020043 https://www.wikidata.org/entity/Q93010577 db/journals/jbcb/jbcb16.html#Al-MubaidDEA18

Pawel Górecki 0001 Oliver Eulenstein Bijective Diameters of Gene Tree Parsimony Costs. 1723-1727 2018 15 IEEE ACM Trans. Comput. Biol. Bioinform. 5 https://doi.org/10.1109/TCBB.2017.2735968 https://doi.ieeecomputersociety.org/10.1109/TCBB.2017.2735968 https://dl.acm.org/doi/10.1109/TCBB.2017.2735968 https://www.wikidata.org/entity/Q46323465 db/journals/tcbb/tcbb15.html#GoreckiE18

Pawel Tabaszewski Pawel Górecki 0001 Oliver Eulenstein Phylogenetic Consensus for Exact Median Trees. 366-375 2018 BCB https://doi.org/10.1145/3233547.3233560 conf/bcb/2018 db/conf/bcb/bcb2018.html#TabaszewskiGE18 Pawel Górecki 0001 Alexey Markin Oliver Eulenstein Cophenetic Distances: A Near-Linear Time Algorithmic Framework. 168-179 2018 COCOON https://doi.org/10.1007/978-3-319-94776-1_15 conf/cocoon/2018 db/conf/cocoon/cocoon2018.html#GoreckiME18 Alexey Markin Venkata Sai Krishna Teja Vadali Oliver Eulenstein Solving the Gene Duplication Feasibility Problem in Linear Time. 378-390 2018 COCOON https://doi.org/10.1007/978-3-319-94776-1_32 conf/cocoon/2018 db/conf/cocoon/cocoon2018.html#MarkinVE18 Jucheol Moon Oliver Eulenstein Cluster Matching Distance for Rooted Phylogenetic Trees. 321-332 2018 ISBRA https://doi.org/10.1007/978-3-319-94968-0_31 conf/isbra/2018 db/conf/isbra/isbra2018.html#MoonE18

Jucheol Moon Oliver Eulenstein Synthesizing large-scale species trees using the strict consensus approach. 1740002:1-1740002:17 2017 15 J. Bioinform. Comput. Biol. 3 https://doi.org/10.1142/S0219720017400029 https://www.wikidata.org/entity/Q38402839 db/journals/jbcb/jbcb15.html#MoonE17

Oliver Eulenstein Qin Ding 0001 Hisham Al-Mubaid Foreword. 1702004:1-1702004:2 2017 15 J. Bioinform. Comput. Biol. 6 https://doi.org/10.1142/S0219720017020048 https://www.wikidata.org/entity/Q89561495 db/journals/jbcb/jbcb15.html#EulensteinDA17

Pawel Górecki 0001 Jaroslaw Paszek Oliver Eulenstein Unconstrained Diameters for Deep Coalescence. 1002-1012 2017 14 IEEE ACM Trans. Comput. Biol. Bioinform. 5 https://doi.org/10.1109/TCBB.2016.2520937 https://doi.ieeecomputersociety.org/10.1109/TCBB.2016.2520937 https://dl.acm.org/doi/10.1109/TCBB.2016.2520937 https://www.wikidata.org/entity/Q46594577 db/journals/tcbb/tcbb14.html#GoreckiPE17

Alexey Markin Oliver Eulenstein Cophenetic Median Trees Under the Manhattan Distance. 194-202 2017 BCB https://doi.org/10.1145/3107411.3107443 conf/bcb/2017 db/conf/bcb/bcb2017.html#MarkinE17 Jucheol Moon Oliver Eulenstein Synthesizing Species Trees from Unrooted Gene Trees: A Parameterized Approach. 253-262 2017 BCB https://doi.org/10.1145/3107411.3107450 conf/bcb/2017 db/conf/bcb/bcb2017.html#MoonE17 Pawel Górecki 0001 Alexey Markin Agnieszka Mykowiecka 0002 Jaroslaw Paszek Oliver Eulenstein Phylogenetic Tree Reconciliation: Mean Values for Fixed Gene Trees. 234-245 2017 ISBRA https://doi.org/10.1007/978-3-319-59575-7_21 conf/isbra/2017 db/conf/isbra/isbra2017.html#GoreckiMMPE17

Jucheol Moon Harris T. Lin Oliver Eulenstein Consensus properties and their large-scale applications for the gene duplication problem. 1642005:1-1642005:17 2016 14 J. Bioinform. Comput. Biol. 3 https://doi.org/10.1142/S0219720016420051 https://www.wikidata.org/entity/Q38415061 db/journals/jbcb/jbcb14.html#MoonLE16

Jucheol Moon Oliver Eulenstein Robinson-Foulds Median Trees: A Clique-based Heuristic. 374-383 2016 BCB https://doi.org/10.1145/2975167.2975206 conf/bcb/2016 db/conf/bcb/bcb2016.html#MoonE16 Alexey Markin Oliver Eulenstein Manhattan Path-Difference Median Trees. 404-413 2016 BCB https://doi.org/10.1145/2975167.2975209 conf/bcb/2016 db/conf/bcb/bcb2016.html#MarkinE16 Jucheol Moon Iddo Friedberg Oliver Eulenstein Highly Bi-Connected Subgraphs for Computational Protein Function Annotation. 573-584 2016 COCOON https://doi.org/10.1007/978-3-319-42634-1_46 https://www.wikidata.org/entity/Q57949660 conf/cocoon/2016 db/conf/cocoon/cocoon2016.html#MoonFE16 Alexey Markin Oliver Eulenstein Path-Difference Median Trees. 211-223 2016 ISBRA https://doi.org/10.1007/978-3-319-38782-6_18 conf/isbra/2016 db/conf/isbra/isbra2016.html#MarkinE16

Pawel Górecki 0001 Oliver Eulenstein Gene Tree Diameter for Deep Coalescence. 155-165 2015 12 IEEE ACM Trans. Comput. Biol. Bioinform. 1 https://doi.org/10.1109/TCBB.2014.2351795 https://doi.ieeecomputersociety.org/10.1109/TCBB.2014.2351795 https://dl.acm.org/doi/10.1109/TCBB.2014.2351795 https://www.wikidata.org/entity/Q46671692 db/journals/tcbb/tcbb12.html#GoreckiE15

Cynthia Gibas Zhipeng Cai 0001 Oliver Eulenstein Guest editors' introduction to the Proceedings of the 9th International Symposium on Biomedical Research and Applications. S1 2014 15 BMC Bioinform. S-13 https://doi.org/10.1186/1471-2105-15-S13-S1 https://www.wikidata.org/entity/Q43044820 db/journals/bmcbi/bmcbi15S.html#GibasCE14

Pawel Górecki 0001 Oliver Eulenstein Refining discordant gene trees. S3 2014 15 BMC Bioinform. S-13 https://doi.org/10.1186/1471-2105-15-S13-S3 https://www.wikidata.org/entity/Q34592364 db/journals/bmcbi/bmcbi15S.html#GoreckiE14

Pawel Górecki 0001 Oliver Eulenstein DrML: Probabilistic Modeling of Gene Duplications. 89-98 2014 21 J. Comput. Biol. 1 https://doi.org/10.1089/cmb.2013.0078 https://www.wikidata.org/entity/Q28660868 db/journals/jcb/jcb21.html#GoreckiE14

Pawel Górecki 0001 Oliver Eulenstein Maximizing Deep Coalescence Cost. 231-242 2014 11 IEEE ACM Trans. Comput. Biol. Bioinform. 1 https://doi.org/10.1109/TCBB.2013.144 https://doi.ieeecomputersociety.org/10.1109/TCBB.2013.144 https://dl.acm.org/doi/10.1109/TCBB.2013.144 https://www.wikidata.org/entity/Q46954602 db/journals/tcbb/tcbb11.html#GoreckiE14

Zhipeng Cai 0001 Oliver Eulenstein Cynthia Gibas Guest Editors Introduction to the Special Section on Bioinformatics Research and Applications. 453-454 2014 11 IEEE ACM Trans. Comput. Biol. Bioinform. 3 https://doi.org/10.1109/TCBB.2014.2306114 https://doi.ieeecomputersociety.org/10.1109/TCBB.2014.2306114 https://dl.acm.org/doi/10.1109/TCBB.2014.2306114 https://www.wikidata.org/entity/Q59158357 db/journals/tcbb/tcbb11.html#CaiEG14

Pawel Górecki 0001 Jaroslaw Paszek Oliver Eulenstein Unconstrained gene tree diameters for deep coalescence. 114-121 2014 BCB https://doi.org/10.1145/2649387.2649410 conf/bcb/2014 db/conf/bcb/bcb2014.html#GoreckiPE14 Pawel Górecki 0001 Jaroslaw Paszek Oliver Eulenstein Duplication Cost Diameters. 212-223 2014 ISBRA https://doi.org/10.1007/978-3-319-08171-7_19 conf/isbra/2014 db/conf/isbra/isbra2014.html#GoreckiPE14 Sabine Baumann Oliver Eulenstein Big Guys and Big Data: Mining Shareholder Interaction Networks of Transnational MediaCompanies with Weighted Quasi-Bicliques. 181-193 2014 MKWI conf/mkwi/2014 db/conf/mkwi/mkwi2014.html#BaumannE14

Wen-Chieh Chang 0002 Pawel Górecki 0001 Oliver Eulenstein Exact solutions for species Tree Inference from discordant gene Trees. 2013 11 J. Bioinform. Comput. Biol. 5 https://doi.org/10.1142/S0219720013420055 https://www.wikidata.org/entity/Q46024046 db/journals/jbcb/jbcb11.html#0002GE13

Pawel Górecki 0001 Oliver Eulenstein Jerzy Tiuryn Unrooted Tree Reconciliation: A Unified Approach. 522-536 2013 10 IEEE ACM Trans. Comput. Biol. Bioinform. 2 https://doi.org/10.1109/TCBB.2013.22 https://doi.ieeecomputersociety.org/10.1109/TCBB.2013.22 https://dl.acm.org/doi/10.1109/TCBB.2013.22 https://www.wikidata.org/entity/Q51175210 db/journals/tcbb/tcbb10.html#GoreckiET13

Mukul S. Bansal Oliver Eulenstein Algorithms for Genome-Scale Phylogenetics Using Gene Tree Parsimony. 939-956 2013 10 IEEE ACM Trans. Comput. Biol. Bioinform. 4 https://doi.org/10.1109/TCBB.2013.103 https://doi.ieeecomputersociety.org/10.1109/TCBB.2013.103 https://dl.acm.org/doi/10.1109/TCBB.2013.103 https://www.wikidata.org/entity/Q46102621 db/journals/tcbb/tcbb10.html#BansalE13

André Wehe J. Gordon Burleigh Oliver Eulenstein Efficient Algorithms for Knowledge-Enhanced Supertree and Supermatrix Phylogenetic Problems. 1432-1441 2013 10 IEEE ACM Trans. Comput. Biol. Bioinform. 6 https://doi.org/10.1109/TCBB.2012.162 https://doi.ieeecomputersociety.org/10.1109/TCBB.2012.162 https://dl.acm.org/doi/10.1109/TCBB.2012.162 https://www.wikidata.org/entity/Q45755286 db/journals/tcbb/tcbb10.html#WeheBE13

Zhipeng Cai 0001 Oliver Eulenstein Daniel Janies Daniel Schwartz Bioinformatics Research and Applications, 9th International Symposium, ISBRA 2013, Charlotte, NC, USA, May 20-22, 2013. Proceedings Springer 2013 978-3-642-38035-8 978-3-642-38036-5 https://doi.org/10.1007/978-3-642-38036-5 7875 Lecture Notes in Computer Science ISBRA db/conf/isbra/isbra2013.html

Ruchi Chaudhary J. Gordon Burleigh Oliver Eulenstein Efficient error correction algorithms for gene tree reconciliation based on duplication, duplication and loss, and deep coalescence. S11 2012 13 BMC Bioinform. S-10 https://doi.org/10.1186/1471-2105-13-S10-S11 https://www.wikidata.org/entity/Q34324647 db/journals/bmcbi/bmcbi13S.html#ChaudharyBE12

Harris T. Lin J. Gordon Burleigh Oliver Eulenstein Consensus properties for the deep coalescence problem and their application for scalable tree search. S12 2012 13 BMC Bioinform. S-10 https://doi.org/10.1186/1471-2105-13-S10-S12 https://www.wikidata.org/entity/Q34324652 db/journals/bmcbi/bmcbi13S.html#LinBE12

Pawel Górecki 0001 Oliver Eulenstein Algorithms: simultaneous error-correction and rooting for gene tree reconciliation and the gene duplication problem. S14 2012 13 BMC Bioinform. S-10 https://doi.org/10.1186/1471-2105-13-S10-S14 https://www.wikidata.org/entity/Q34324657 db/journals/bmcbi/bmcbi13S.html#GoreckiE12

Wen-Chieh Chang 0002 Sudheer Vakati Roland Krause Oliver Eulenstein Exploring biological interaction networks with tailored weighted quasi-bicliques. S16 2012 13 BMC Bioinform. S-10 https://doi.org/10.1186/1471-2105-13-S10-S16 https://www.wikidata.org/entity/Q34324667 db/journals/bmcbi/bmcbi13S.html#0002VKE12

Pawel Górecki 0001 Oliver Eulenstein Deep Coalescence Reconciliation with Unrooted Gene Trees: Linear Time Algorithms. 531-542 2012 COCOON https://doi.org/10.1007/978-3-642-32241-9_45 conf/cocoon/2012 db/conf/cocoon/cocoon2012.html#GoreckiE12 Pawel Górecki 0001 J. Gordon Burleigh Oliver Eulenstein GTP Supertrees from Unrooted Gene Trees: Linear Time Algorithms for NNI Based Local Searches. 102-114 2012 ISBRA https://doi.org/10.1007/978-3-642-30191-9_11 conf/isbra/2012 db/conf/isbra/isbra2012.html#GoreckiBE12 Pawel Górecki 0001 Oliver Eulenstein A Robinson-Foulds Measure to Compare Unrooted Trees with Rooted Trees. 115-126 2012 ISBRA https://doi.org/10.1007/978-3-642-30191-9_12 conf/isbra/2012 db/conf/isbra/isbra2012.html#GoreckiE12 André Wehe J. Gordon Burleigh Oliver Eulenstein Algorithms for Knowledge-Enhanced Supertrees. 263-274 2012 ISBRA https://doi.org/10.1007/978-3-642-30191-9_25 conf/isbra/2012 db/conf/isbra/isbra2012.html#WeheBE12

Wen-Chieh Chang 0002 J. Gordon Burleigh David Fernández-Baca Oliver Eulenstein An ILP solution for the gene duplication problem. S14 2011 12 BMC Bioinform. S-1 https://doi.org/10.1186/1471-2105-12-S1-S14 https://www.wikidata.org/entity/Q33826902 db/journals/bmcbi/bmcbi12S.html#0002BFE11

Pawel Górecki 0001 J. Gordon Burleigh Oliver Eulenstein Maximum likelihood models and algorithms for gene tree evolution with duplications and losses. S15 2011 12 BMC Bioinform. S-1 https://doi.org/10.1186/1471-2105-12-S1-S15 https://www.wikidata.org/entity/Q42199252 db/journals/bmcbi/bmcbi12S.html#GoreckiBE11

John Wiedenhoeft Roland Krause Oliver Eulenstein The Plexus Model for the Inference of Ancestral Multidomain Proteins. 890-901 2011 8 IEEE ACM Trans. Comput. Biol. Bioinform. 4 https://doi.org/10.1109/TCBB.2011.22 https://doi.ieeecomputersociety.org/10.1109/TCBB.2011.22 https://dl.acm.org/doi/10.1109/TCBB.2011.22 https://www.wikidata.org/entity/Q46747849 db/journals/tcbb/tcbb8.html#WiedenhoeftKE11

Oliver Eulenstein Invited: Reconciled gene trees and their applications. 6 2011 ICCABS https://doi.org/10.1109/ICCABS.2011.5729942 https://doi.ieeecomputersociety.org/10.1109/ICCABS.2011.5729942 conf/iccabs/2011 db/conf/iccabs/iccabs2011.html#Eulenstein11 Pawel Górecki 0001 Oliver Eulenstein A Linear Time Algorithm for Error-Corrected Reconciliation of Unrooted Gene Trees. 148-159 2011 ISBRA https://doi.org/10.1007/978-3-642-21260-4_17 conf/isbra/2011 db/conf/isbra/isbra2011.html#GoreckiE11 Harris T. Lin J. Gordon Burleigh Oliver Eulenstein The Deep Coalescence Consensus Tree Problem is Pareto on Clusters. 172-183 2011 ISBRA https://doi.org/10.1007/978-3-642-21260-4_19 conf/isbra/2011 db/conf/isbra/isbra2011.html#LinBE11 Ruchi Chaudhary J. Gordon Burleigh Oliver Eulenstein Algorithms for Rapid Error Correction for the Gene Duplication Problem. 227-239 2011 ISBRA https://doi.org/10.1007/978-3-642-21260-4_23 conf/isbra/2011 db/conf/isbra/isbra2011.html#ChaudharyBE11 Wen-Chieh Chang 0002 Sudheer Vakati Roland Krause Oliver Eulenstein Mining Biological Interaction Networks Using Weighted Quasi-Bicliques. 428-439 2011 ISBRA https://doi.org/10.1007/978-3-642-21260-4_40 https://www.wikidata.org/entity/Q58486313 conf/isbra/2011 db/conf/isbra/isbra2011.html#ChangVKE11

Mukul S. Bansal J. Gordon Burleigh Oliver Eulenstein David Fernández-Baca Robinson-Foulds Supertrees. 18 2010 5 Algorithms Mol. Biol. https://doi.org/10.1186/1748-7188-5-18 https://www.wikidata.org/entity/Q27498957 db/journals/almob/almob5.html#BansalBEF10

Mukul S. Bansal J. Gordon Burleigh Oliver Eulenstein Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models. 42 2010 11 BMC Bioinform. S-1 https://doi.org/10.1186/1471-2105-11-S1-S42 https://www.wikidata.org/entity/Q33528229 db/journals/bmcbi/bmcbi11S.html#BansalBE10

Ruchi Chaudhary Mukul S. Bansal André Wehe David Fernández-Baca Oliver Eulenstein iGTP: A software package for large-scale gene tree parsimony analysis. 574 2010 11 BMC Bioinform. https://doi.org/10.1186/1471-2105-11-574 https://www.wikidata.org/entity/Q33752245 db/journals/bmcbi/bmcbi11.html#ChaudharyBWFE10

André Wehe Wen-Chieh Chang 0002 Oliver Eulenstein Srinivas Aluru A scalable parallelization of the gene duplication problem. 237-244 2010 70 J. Parallel Distributed Comput. 3 https://doi.org/10.1016/j.jpdc.2009.09.010 db/journals/jpdc/jpdc70.html#WeheCEA10

J. Gordon Burleigh Mukul S. Bansal Oliver Eulenstein Todd J. Vision Inferring species trees from gene duplication episodes. 198-203 2010 BCB https://doi.org/10.1145/1854776.1854806 https://www.wikidata.org/entity/Q57274056 conf/bcb/2010 db/conf/bcb/bcb2010.html#BurleighBEV10 Max Homilius John Gordon Burleigh Oliver Eulenstein Triplet-Supertrees constructed from Minimum Triplet Presentations. 127-132 2010 BICoB conf/bicob/2010 db/conf/bicob/bicob2010.html#HomiliusBE10 John Wiedenhoeft Roland Krause Oliver Eulenstein Inferring Evolutionary Scenarios for Protein Domain Compositions. 179-190 2010 ISBRA https://doi.org/10.1007/978-3-642-13078-6_21 https://www.wikidata.org/entity/Q58486319 conf/isbra/2010 db/conf/isbra/isbra2010.html#WiedenhoeftKE10

Harris T. Lin J. Gordon Burleigh Oliver Eulenstein Triplet supertree heuristics for the tree of life. 2009 10 BMC Bioinform. S-1 https://doi.org/10.1186/1471-2105-10-S1-S8 https://www.wikidata.org/entity/Q33407961 db/journals/bmcbi/bmcbi10S.html#LinBE09

John Gordon Burleigh Mukul S. Bansal André Wehe Oliver Eulenstein Locating Large-Scale Gene Duplication Events through Reconciled Trees: Implications for Identifying Ancient Polyploidy Events in Plants. 1071-1083 2009 16 J. Comput. Biol. 8 https://doi.org/10.1089/cmb.2009.0139 https://www.wikidata.org/entity/Q47448349 db/journals/jcb/jcb16.html#BurleighBWE09

Mukul S. Bansal Oliver Eulenstein André Wehe The Gene-Duplication Problem: Near-Linear Time Algorithms for NNI-Based Local Searches. 221-231 2009 6 IEEE ACM Trans. Comput. Biol. Bioinform. 2 https://doi.org/10.1109/TCBB.2009.7 https://doi.ieeecomputersociety.org/10.1109/TCBB.2009.7 https://dl.acm.org/doi/10.1109/TCBB.2009.7 https://www.wikidata.org/entity/Q51834761 db/journals/tcbb/tcbb6.html#BansalEW09

Mukul S. Bansal Wen-Chieh Chang 0002 Oliver Eulenstein David Fernández-Baca Generalized Binary Tanglegrams: Algorithms and Applications. 114-125 2009 BICoB https://doi.org/10.1007/978-3-642-00727-9_13 conf/bicob/2009 db/conf/bicob/bicob2009.html#BansalCEF09

André Wehe Mukul S. Bansal J. Gordon Burleigh Oliver Eulenstein DupTree: a program for large-scale phylogenetic analyses using gene tree parsimony. 1540-1541 2008 24 Bioinform. 13 https://doi.org/10.1093/bioinformatics/btn230 https://www.wikidata.org/entity/Q42655147 db/journals/bioinformatics/bioinformatics24.html#WeheBBE08

Mukul S. Bansal Oliver Eulenstein An Omega(n^2/ log n) Speed-Up of TBR Heuristics for the Gene-Duplication Problem. 514-524 2008 5 IEEE ACM Trans. Comput. Biol. Bioinform. 4 https://doi.org/10.1109/TCBB.2008.69 https://doi.ieeecomputersociety.org/10.1109/TCBB.2008.69 https://dl.acm.org/doi/10.1109/TCBB.2008.69 https://www.wikidata.org/entity/Q51864255 db/journals/tcbb/tcbb5.html#BansalE08

Mukul S. Bansal Oliver Eulenstein The Gene-Duplication Problem: Near-Linear Time Algorithms for NNI Based Local Searches. 14-25 2008 ISBRA https://doi.org/10.1007/978-3-540-79450-9_3 conf/isbra/2008 db/conf/isbra/isbra2008.html#BansalE08 Mukul S. Bansal Oliver Eulenstein The multiple gene duplication problem revisited. 132-138 2008 ISMB https://doi.org/10.1093/bioinformatics/btn150 https://www.wikidata.org/entity/Q37283270 conf/ismb/2008 db/conf/ismb/ismb2008.html#BansalE08 J. Gordon Burleigh Mukul S. Bansal André Wehe Oliver Eulenstein Locating Multiple Gene Duplications through Reconciled Trees. 273-284 2008 RECOMB https://doi.org/10.1007/978-3-540-78839-3_24 conf/recomb/2008 db/conf/recomb/recomb2008.html#BurleighBWE08 Mukul S. Bansal J. Gordon Burleigh Oliver Eulenstein André Wehe Heuristics for the Gene-Duplication Problem: A Theta ( n ) Speed-Up for the Local Search. 238-252 2007 conf/recomb/2007 RECOMB https://doi.org/10.1007/978-3-540-71681-5_17 db/conf/recomb/recomb2007.html#BansalBEW07 Mukul S. Bansal Oliver Eulenstein An Omega(n2/log n) Speed-Up of TBR Heuristics for the Gene-Duplication Problem. 124-135 2007 conf/wabi/2007 WABI https://doi.org/10.1007/978-3-540-74126-8_12 db/conf/wabi/wabi2007.html#BansalE07

Duhong Chen Oliver Eulenstein David Fernández-Baca Michael J. Sanderson Minimum-Flip Supertrees: Complexity and Algorithms. 165-173 2006 3 IEEE ACM Trans. Comput. Biol. Bioinform. 2 https://doi.org/10.1109/TCBB.2006.26 https://doi.ieeecomputersociety.org/10.1109/TCBB.2006.26 https://dl.acm.org/doi/10.1109/TCBB.2006.26 https://www.wikidata.org/entity/Q43560851 db/journals/tcbb/tcbb3.html#ChenEFS06

Wen-Chieh Chang 0002 Oliver Eulenstein Reconciling Gene Trees with Apparent Polytomies. 235-244 2006 conf/cocoon/2006 COCOON https://doi.org/10.1007/11809678_26 db/conf/cocoon/cocoon2006.html#ChangE06

Duhong Chen Oliver Eulenstein David Fernández-Baca Rainbow: a toolbox for phylogenetic supertree construction and analysis. 2872-2873 2004 20 Bioinform. 16 https://doi.org/10.1093/bioinformatics/bth313 https://www.wikidata.org/entity/Q80093339 db/journals/bioinformatics/bioinformatics20.html#ChenEF04

Duhong Chen Oliver Eulenstein David Fernández-Baca Michael J. Sanderson Supertrees by Flipping. 391-400 2002 conf/cocoon/2002 COCOON https://doi.org/10.1007/3-540-45655-4_42 db/conf/cocoon/cocoon2002.html#ChenEFS02 J. Schonfeld Oliver Eulenstein Kent Vander Velden Gavin J. P. Naylor Investigating Evolutionary Lines of Least Resistance Using the Inverse Protein-Folding Problem. 613-624 2002 conf/psb/2002 Pacific Symposium on Biocomputing http://psb.stanford.edu/psb-online/proceedings/psb02/schonfeld.pdf db/conf/psb/psb2002.html#SchonfeldEVN02 Duhong Chen Lixia Diao Oliver Eulenstein David Fernández-Baca Michael J. Sanderson Flipping: A supertree construction method. 135-160 2001 Bioconsensus conf/dimacs/dimacs61 db/conf/dimacs/dimacs61.html#ChenDEFS01 https://doi.org/10.1090/dimacs/061/10 Oliver Eulenstein Vorhersage von Genduplikationen und deren Entwicklung in der Evolution. I-XII, 1-189 GMD 1999 GMD research series 20/1998 978-3-88457-344-0

Yan P. Yuan Oliver Eulenstein Martin Vingron Peer Bork Towards detection of orthologues in sequence databases. 285-289 1998 14 Bioinform. 3 db/journals/bioinformatics/bioinformatics14.html#YuanEVB98 https://doi.org/10.1093/bioinformatics/14.3.285 https://www.wikidata.org/entity/Q48037664

Oliver Eulenstein Martin Vingron On the Equivalence of Two Tree Mapping Measures. 103-128 1998 88 Discret. Appl. Math. 1-3 https://doi.org/10.1016/S0166-218X(98)00068-7 db/journals/dam/dam88.html#EulensteinV98

Oliver Eulenstein Boris G. Mirkin Martin Vingron Duplication-Based Measures of Difference Between Gene and Species Trees. 135-148 1998 5 J. Comput. Biol. 1 db/journals/jcb/jcb5.html#EulensteinMV98 https://doi.org/10.1089/cmb.1998.5.135 https://www.wikidata.org/entity/Q52243607

Yan P. Yuan Oliver Eulenstein Martin Vingron Peer Bork Towards detection of sequence orthologs. 25-30 1997 conf/gcb/1997 German Conference on Bioinformatics db/conf/gcb/gcb1997.html#YuanEVB97 Oliver Eulenstein Boris G. Mirkin Martin Vingron Comparison of annotating duplication, tree mapping, and copying as methods to compare gene trees with species trees. 71-94 1996 Mathematical Hierarchies and Biology conf/dimacs/dimacs37 db/conf/dimacs/dimacs37.html#EulensteinMV96 https://doi.org/10.1090/dimacs/037/05 Hisham Al-Mubaid Fulayjan Alanazi Srinivas Aluru Tavis K. Anderson Javad Ansarifar Mukul S. Bansal Sabine Baumann Peer Bork John Gordon BurleighJ. Gordon Burleigh Zhipeng Cai 0001 Mohna Chakraborty Wen-Chieh Chang 0002 Ruchi Chaudhary Duhong Chen Alvin Chon Lixia Diao Qin Ding 0001 David Fernández-Baca Iddo Friedberg Ashraf Gaffar Cynthia Gibas Pawel Górecki 0001 Siddhant Grover Max Homilius Xiaoqiu Huang 0001 Ashish Jain Daniel Janies Ali Jannesari Roland Krause Adithya Kulkarni Qi Li 0012 Harris T. Lin Alexey Markin Boris G. Mirkin Jucheol Moon Agnieszka Mykowiecka 0002 Gavin J. P. Naylor Huy N. Nguyen Jaroslaw Paszek Nasim Sabetpour Michael J. Sanderson J. Schonfeld Daniel Schwartz Mohamed Y. Selim Pawel Tabaszewski Jerzy Tiuryn Venkata Sai Krishna Teja Vadali Sudheer Vakati Kent Vander Velden Sriram Vijendran Martin Vingron Todd J. Vision Sanket Wagle André Wehe John Wiedenhoeft Yan P. Yuan