Ultrafast Bootstrap Approximation
Ultrafast Bootstrap Approximation is a computational method in phylogenetics that belongs to the class of bootstrap resampling techniques and is distinguished by its use of an efficient approximation algorithm to rapidly assess branch support in maximum likelihood trees by employing a multi-threaded, parsimony-based resampling scheme with conjugate gradient optimization to reduce computational burden.
4
Publications
16.5K
Citations
9
Authors
10
Institutions
Publications per year
2017–2026
3
Variants
Ufboot
4
UFBoot2: Improving the Ultrafast Bootstrap Approximation
Diep Thi Hoang, Olga Chernomor, Arndt von Haeseler et al. · Molecular Biology and Evolution · 2017 · 11K citations · Full text
UFBoot2: Improving the Ultrafast Bootstrap Approximation
Diep Thi Hoang, Olga Chernomor, Arndt von Haeseler et al. · bioRxiv (Cold Spring Harbor Laboratory) · 2017 · 360 citations · Full text
MPBoot: fast phylogenetic maximum parsimony tree inference and bootstrap approximation
Diep Thi Hoang, Lê Sỹ Vinh, Tomáš Flouri et al. · BMC Evolutionary Biology · 2018 · 197 citations · Full text
1–4 of 4
9
4
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 9
10

Max Perutz Labs
Vienna, Austria
4 h-index
10 publications
44.5K citations
University of Vienna
Vienna, Austria
3 h-index
8 publications
34.6K citations
Vietnam National University, Hanoi
Hanoi, Vietnam
3 h-index
6 publications
23.2K citations

TU Wien
Vienna, Austria
1 h-index
1 publications
197 citations
Vienna Biocenter
Vienna, Austria
1 h-index
2 publications
394 citations
Karlsruhe Institute of Technology
Karlsruhe, Germany
1 h-index
1 publications
197 citations
Heidelberg Institute for Theoretical Studies
Heidelberg, Germany
1 h-index
1 publications
197 citations
Medical University of Vienna
Vienna, Austria
1 h-index
2 publications
9.9K citations
1–8 of 10
MBE · 2 publications · 16K citations
2
h-index
1 publications · 197 citations
1
h-index
Repository · 1 publications · 360 citations
1
h-index
1–3