EDBT 2026 Demo / reviewers in the wild / expert
Yu Zheng 0018
dblp:87/1585-18
· DBLP profile ↗
6ranked-venue papers
6as first author
0since 2021 · last 2017
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 5 · 5 first-authorArtificial intelligence and machine learning · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
2 papers |
Bioinformatics and computational biology · 100% | |
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 50% Algorithms and data structures · 50% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › phylogenetics
gene tree reconciliation |
0.5 | 2 | 2017 | Reconciliation With Nonbinary Gene Trees Revisited · J. ACM 2017 Reconciliation with Non-binary Gene Trees Revisited · RECOMB 2014 |
Bioinformatics and computational biology
phylogenetics |
0.5 | 2 | 2017 | Reconciliation With Nonbinary Gene Trees Revisited · J. ACM 2017 Reconciliation with Non-binary Gene Trees Revisited · RECOMB 2014 |
Algorithms and data structures › polynomial-time algorithms
linear-time algorithms |
0.3 | 1 | 2017 | Reconciliation With Nonbinary Gene Trees Revisited · J. ACM 2017 |
Graph algorithms and graph theory › graph algorithms
tree algorithms |
0.3 | 1 | 2017 | Reconciliation With Nonbinary Gene Trees Revisited · J. ACM 2017 |
Methods — techniques the papers use, named apart from their topics
wagner parsimony · 0.6dynamic programming · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | Reconciliation With Nonbinary Gene Trees RevisitedabstractBy reconciling the phylogenetic tree of a gene family with the corresponding species tree, it is possible to infer lineage-specific duplications and losses with high confidence and hence to annotate orthologs and paralogs. The currently available reconciliation methods for nonbinary gene trees are computationally expensive for genome-scale applications. We present four O (| G |+| S |) algorithms to reconcile an arbitrary gene tree G with a binary species tree S in the duplication, loss, duploss (also known as mutation), and deep coalescence cost models, where |· | denotes the number of nodes in a tree. The improvement is achieved through two innovations: a linear-time computation of compressed child-image subtrees and efficient reconstruction of irreducible duplication histories. Our technique for child-image subtree compression also results in an order of magnitude speedup in runtime for the dynamic programming and Wagner parsimony--based methods for tree reconciliation in the affine cost model. Yu Zheng 0018, Louxin Zhang |
J. ACM | 1 |
| 2014 | Reconciliation with Non-binary Gene Trees Revisited
Yu Zheng 0018, Louxin Zhang |
RECOMB | 1 |
| 2014 | Effect of Incomplete Lineage SortingOn Tree-Reconciliation-Based Inferenceof Gene DuplicationabstractIn the tree reconciliation approach to infer the duplication history of a gene family, the gene (family) tree is compared to the corresponding species tree. Incomplete lineage sorting (ILS) gives rise to stochastic variation in the topology of a gene tree and hence likely introduces false duplication events when a tree reconciliation method is used. We quantify the effect of ILS on gene duplication inference in a species tree in terms of the expected number of false duplication events inferred from reconciling a random gene tree, which occurs with a probability predicted in coalescent theory, and the species tree. We computationally examine the relationship between the effect of ILS on duplication inference in a species tree and its topological parameters. Our findings suggest that ILS may cause non-negligible bias on duplication inference, particularly on an asymmetric species tree. Hence, when gene duplication is inferred via tree reconciliation or any other approach that takes gene tree topology into account, the ILS-induced bias should be examined cautiously. Yu Zheng 0018, Louxin Zhang |
IEEE ACM Trans. Comput. Biol. Bioinform. | 1 |
| 2013 | A Linear-Time Algorithm for Reconciliation of Non-binary Gene Tree and Binary Species Tree
Yu Zheng 0018, Taoyang Wu, Louxin Zhang |
COCOA | 1 |
| 2013 | A Tool for Non-binary Tree Reconciliation
Yu Zheng 0018, Louxin Zhang |
ISBRA | 1 |
| 2013 | Effect of Incomplete Lineage Sorting on Tree-Reconciliation-Based Inference of Gene Duplication
Yu Zheng 0018, Louxin Zhang |
ISBRA | 1 |