Parallel Tree Search Algorithms
Parallel Tree Search Algorithms is a computational strategy in phylogenetic inference that belongs to the class of tree search methods and is distinguished by its simultaneous exploration of multiple regions of the tree space using parallel processing to enhance the efficiency and scalability of maximum likelihood tree estimation.
29
Publications
1.2K
Citations
87
Authors
42
Institutions
Publications per year
2017–2026
5
29
Real-time KD-tree construction on graphics hardware
Kun Zhou, Qiming Hou, Rui Wang et al. · ACM Transactions on Graphics · 2008 · 490 citations
Real-time KD-tree construction on graphics hardware
Kun Zhou, Qiming Hou, Rui Wang et al. · 2008 · 104 citations
A non-blocking internal binary search tree
Shane Valentine Howley, Jeremy Jones · 2012 · 95 citations
1–5 of 29
87
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 87
42
Microsoft Research Asia (China)
Beijing, China
2 h-index
4 publications
1.2K citations

Zhejiang University
Hangzhou, China
2 h-index
4 publications
1.2K citations

Chinese Academy of Sciences
Beijing, China
2 h-index
5 publications
83 citations
National University of Singapore
Singapore, Singapore
2 h-index
8 publications
276 citations

Trinity College Dublin
Dublin, Ireland
2 h-index
5 publications
220 citations
Tsinghua University
Beijing, China
2 h-index
4 publications
1.2K citations

City University of Hong Kong
Hong Kong, Hong Kong
1 h-index
2 publications
22 citations

Paderborn University
Paderborn, Germany
1 h-index
3 publications
57 citations
1–8 of 42
3 publications · 59 citations
3
h-index
TPDS · 2 publications · 28 citations
2
h-index
2 publications · 52 citations
2
h-index
CBAC · 1 publications · 23 citations
1
h-index
1 publications · 11 citations
1
h-index
1–5