Tree Searching Algorithms

Tree Searching Algorithms is a computational procedure in phylogenetic systematics that systematically explores the discrete space of possible phylogenetic tree topologies to identify those that optimally fit given character data according to specified optimality criteria.

508

Publications

262K

Citations

1.1K

Authors

538

Institutions

Publications per year

2017–2026

68

Authors

1.1K

  1. AS
    Alexandros Stamatakis

    Heidelberg Institute for Theoretical Studies, Germany

    18 publications · 21.7K citations

    15

    h-index

  2. PA
    Pablo A. Goloboff

    Fundación Miguel Lillo, Argentina

    11 publications · 5.1K citations

    11

    h-index

  3. DF
    David Fernández‐Baca

    Iowa State University, United States

    9 publications · 304 citations

    9

    h-index

  4. TW
    Tandy Warnow

    The University of Texas at Austin, United States

    9 publications · 397 citations

    9

    h-index

  5. MD
    Michael D. Hendy

    Massey University, New Zealand

    9 publications · 843 citations

    9

    h-index

1–5 of 1.1K

Venues

  1. Systematic Biology

    33 publications · 26.8K citations

    29

    h-index

  2. Cladistics

    37 publications · 7.5K citations

    27

    h-index

  3. Bioinformatics

    24 publications · 26.1K citations

    20

    h-index

  4. Molecular Phylogenetics and Evolution

    17 publications · 2.1K citations

    16

    h-index

  5. Molecular Biology and Evolution

    MBE · 11 publications · 142.1K citations

    11

    h-index

1–5