Supertree Algorithms

Supertree Algorithms is a computational method that integrates multiple overlapping phylogenetic trees into a single comprehensive tree while preserving the topological relationships of the input trees.

217

Publications

16.2K

Citations

459

Authors

267

Institutions

Publications per year

2017–2026

30

Authors

459

  1. OR
    Olaf R. P. Bininda‐Emonds

    Carl von Ossietzky Universität Oldenburg, Germany

    16 publications · 2.6K citations

    16

    h-index

  2. OE
    Oliver Eulenstein

    Iowa State University, United States

    12 publications · 552 citations

    11

    h-index

  3. TW
    Tandy Warnow

    The University of Texas at Austin, United States

    11 publications · 749 citations

    11

    h-index

  4. VB
    Vincent Berry

    Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier, France

    10 publications · 345 citations

    10

    h-index

  5. DF
    David Fernández‐Baca

    Iowa State University, United States

    10 publications · 401 citations

    10

    h-index

1–5 of 459

Venues

  1. Systematic Biology

    38 publications · 2.9K citations

    29

    h-index

  2. 11

    h-index

  3. BMC Evolutionary Biology

    10 publications · 1.5K citations

    10

    h-index

  4. Bioinformatics

    10 publications · 686 citations

    10

    h-index

  5. Algorithms for Molecular Biology

    AMB · 8 publications · 396 citations

    8

    h-index

1–5