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

Authors

87

  1. BG
    Baining Guo

    Microsoft Research Asia (China), China

    2 publications · 594 citations

    2

    h-index

  2. QH
    Qiming Hou

    Zhejiang University, China

    2 publications · 594 citations

    2

    h-index

  3. WS
    Wee Sun Lee

    National University of Singapore, Singapore

    2 publications · 69 citations

    2

    h-index

  4. KZ
    Kun Zhou

    Zhejiang University, China

    2 publications · 594 citations

    2

    h-index

  5. YL
    Yuanfu Luo

    National University of Singapore, Singapore

    2 publications · 69 citations

    2

    h-index

1–5 of 87

Venues

  1. ICGA Journal

    3 publications · 59 citations

    3

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 2 publications · 28 citations

    2

    h-index

  3. Bioinformatics

    2 publications · 52 citations

    2

    h-index

  4. Computational Biology and Chemistry

    CBAC · 1 publications · 23 citations

    1

    h-index

  5. Journal of Algorithms

    1 publications · 11 citations

    1

    h-index

1–5