Diep Thi Hoang

Diep Thi Hoang

Auto-generated profile, based on publicly available information

Diep Thi Hoang

University of Engineering and Technology, Vietnam National University Hanoi

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 October 2017 in Molecular Biology and Evolution
Verified
Journal Article
Open access
PDF file
DHDiep Thi Hoang
Diep Thi Hoang
OCOlga Chernomor
Olga Chernomor
AHArndt von Haeseler
Arndt von Haeseler
MBMinh Bui
Minh Bui
LVLe Sy Vinh
Le Sy Vinh
The standard bootstrap (SBS), despite being computationally intensive, is widely used in maximum likelihood phylogenetic analyses. We recently proposed the ultrafast bootstrap approximation (UFBoot) to reduce computing time while achieving more unbiased branch supports than SBS under mild model violations. UFBoot has been steadily adopted as an efficient alternative to SBS and other bootstrap approaches. Here, we present UFBoot2, which substantially accelerates UFBoot and reduces the risk of overestimating branch supports due to polytomies or severe model violations. Additionally, UFBoot2 provides suitable bootstrap resampling strategies for phylogenomic data. UFBoot2 is 778 times (median) faster than SBS and 8.4 times (median) faster than RAxML rapid bootstrap on tested data sets. UFBoot2 is implemented in the IQ-TREE software package version 1.6 and freely available at http://www.iqtree.org.

2 February 2018 in BMC Ecology and Evolution
Verified
Journal Article
Open access
PDF file
DHDiep Thi Hoang
Diep Thi Hoang
LVLe Sy Vinh
Le Sy Vinh
TFTomáš Flouri
Tomáš Flouri
ASAlexandros Stamatakis
Alexandros Stamatakis
AHArndt von Haeseler
Arndt von Haeseler
MBMinh Bui
Minh Bui
The nonparametric bootstrap is widely used to measure the branch support of phylogenetic trees. However, bootstrapping is computationally expensive and remains a bottleneck in phylogenetic analyses. Recently, an ultrafast bootstrap approximation (UFBoot) approach was proposed for maximum likelihood analyses. However, such an approach is still missing for maximum parsimony. To close this gap we present MPBoot, an adaptation and extension of UFBoot to compute branch supports under the maximum parsimony principle. MPBoot works for both uniform and non-uniform cost matrices. Our analyses on biological DNA and protein showed that under uniform cost matrices, MPBoot runs on average 4.7 (DNA) to 7 times (protein data) (range: 1.2–20.7) faster than the standard parsimony bootstrap implemented in PAUP*; but 1.6 (DNA) to 4.1 times (protein data) slower than the standard bootstrap with a fast search routine in TNT (fast-TNT). However, for non-uniform cost matrices MPBoot is 5 (DNA) to 13 times (protein data) (range:0.3–63.9) faster than fast-TNT. We note that MPBoot achieves better scores more frequently than PAUP* and fast-TNT. However, this effect is less pronounced if an intensive but slower search in TNT is invoked. Moreover, experiments on large-scale simulated data show that while both PAUP* and TNT bootstrap estimates are too conservative, MPBoot bootstrap estimates appear more unbiased. MPBoot provides an efficient alternative to the standard maximum parsimony bootstrap procedure. It shows favorable performance in terms of run time, the capability of finding a maximum parsimony tree, and high bootstrap accuracy on simulated as well as empirical data sets. MPBoot is easy-to-use, open-source and available at http://www.cibiv.at/software/mpboot .

12 September 2012 in PLOS ONE
Verified
Journal Article
Open access
PDF file
JKJasleen Kaur
Jasleen Kaur
DHDiep Thi Hoang
Diep Thi Hoang
XSXiaoling Sun
Xiaoling Sun
LPLino Possamai
Lino Possamai
MJMohsen JafariAsbagh
Mohsen JafariAsbagh
FMFilippo Menczer
Filippo Menczer
The use of quantitative metrics to gauge the impact of scholarly publications, authors, and disciplines is predicated on the availability of reliable usage and annotation data. Citation and download counts are widely available from digital libraries. However, current annotation systems rely on proprietary labels, refer to journals but not articles or authors, and are manually curated. To address these limitations, we propose a social framework based on crowdsourced annotations of scholars, designed to keep up with the rapidly evolving disciplinary and interdisciplinary landscape. We describe a system called Scholarometer, which provides a service to scholars by computing citation-based impact measures. This creates an incentive for users to provide disciplinary annotations of authors, which in turn can be used to compute disciplinary metrics. We first present the system architecture and several heuristics to deal with noisy bibliographic and annotation data. We report on data sharing and interactive visualization services enabled by Scholarometer. Usage statistics, illustrating the data collected and shared through the framework, suggest that the proposed crowdsourcing approach can be successful. Secondly, we illustrate how the disciplinary bibliometric indicators elicited by Scholarometer allow us to implement for the first time a universal impact measure proposed in the literature. Our evaluation suggests that this metric provides an effective means for comparing scholarly impact across disciplinary boundaries.

1 December 2016
Verified
Conference Paper
Closed access
DHDiep Thi Hoang
Diep Thi Hoang
LVLe Sy Vinh
Le Sy Vinh
TFTomas Flouri
Tomas Flouri
ASAlexandros Stamatakis
Alexandros Stamatakis
AHArndt von Haeseler
Arndt von Haeseler
MBMinh Bui
Minh Bui
Reconstructing maximum parsimony (MP) trees along with bootstrap for large multiple sequence alignments is a computationally challenging task. In this paper, we present MPBoot, a new method for approximating MP bootstrap based on the idea of a previously introduced method for maximum likelihood bootstrap. MPBoot economizes the computations by only sampling trees on the original alignment and simultaneously calculating exact parsimony scores for all bootstrap alignments. Preliminary experiments on simulated data showed that MPBoot is about 2–3.5 times faster and yields better parsimony scores than a fast bootstrap procedure implemented in TNT. MPBoot also produced less biased support value than TNT for small simulated data sets (<= 200 sequences). However, for large number of sequences (>=500) MPBoot overestimates the probability that a clade is true, i.e., results in likely high false positive rates. As MPBoot is currently a proof-of-concept implementation, more work is to understand the limitations of the method.


19 October 2022
Verified
Conference Paper
Closed access
THTien Dung Huynh
Tien Dung Huynh
QVQuoc Tuan Vu
Quoc Tuan Vu
VNViet Dung Nguyen
Viet Dung Nguyen
DHDiep Thi Hoang
Diep Thi Hoang
The approximation technique in MPBoot effectively addresses the problem of maximum parsimony phylogenetic bootstrapping, an essential task in bioinformatics with diverse applications in evolutionary biology. In this paper, we investigate integrating the tree bisection and reconnection (TBR) rearrangement to MPBoot to increase its sampling performance in the search space, and we describe the MPBoot-TBR algorithm. Since the size of the TBR neighborhood is cubic in the number of taxa, we offer algorithmic strategies for swiftly evaluating a TBR move, searching quickly in the neighborhood of a specified remove-branch, and hill-climbing using TBR. Furthermore, the framework’s stopping condition is adjusted because compared to the subtree pruning and regrafting, TBR requires fewer search iterations to converge to an acceptable MP score. In terms of bootstrap accuracy, MPBoot-TBR is comparable to MPBoot. In terms of MP score and computation time on real datasets, MPBoot-TBR outperforms the original MPBoot. We have implemented the proposed methods in the MPBoot-TBR program, the source code of which is accessible at https: //github.com/HynDuf7/mpboot/tree/Huynh_Tien_Dung.