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
Parents
508
MEGA6: Molecular Evolutionary Genetics Analysis Version 6.0
Koichiro Tamura, Glen Stecher, Daniel S. Peterson et al. · Molecular Biology and Evolution · 2013 · 47.9K citations · Full text
1–5 of 508
1.1K
Heidelberg Institute for Theoretical Studies, Germany
18 publications · 21.7K citations
15
h-index
11
h-index
9
h-index
9
h-index
9
h-index
1–5 of 1.1K
538

American Museum of Natural History
New York, United States
15 h-index
26 publications
3.9K citations

University of Canterbury
Christchurch, New Zealand
14 h-index
22 publications
7.2K citations
Iowa State University
Ames, United States
13 h-index
33 publications
7.2K citations

Centre National de la Recherche Scientifique
Paris, France
12 h-index
47 publications
116.5K citations
University of California, Berkeley
Berkeley, United States
12 h-index
15 publications
17.1K citations

Massey University
Palmerston North, New Zealand
11 h-index
20 publications
1.7K citations
University of California, Davis
Davis, United States
10 h-index
16 publications
2.6K citations
Heidelberg Institute for Theoretical Studies
Heidelberg, Germany
10 h-index
32 publications
25.8K citations
1–8 of 538
33 publications · 26.8K citations
29
h-index
37 publications · 7.5K citations
27
h-index
24 publications · 26.1K citations
20
h-index
17 publications · 2.1K citations
16
h-index
MBE · 11 publications · 142.1K citations
11
h-index
1–5