default search action
Taoyang Wu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j32]Andrew R. Francis
, Katharina T. Huber
Encoding and ordering X-cactuses. Adv. Appl. Math. 142: 102414 (2023) - [j31]Vincent Moulton
Planar Rooted Phylogenetic Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 20(2): 1289-1297 (2023) - 2022
- [j30]Junlin Xu, Lingyu Cui
Evaluating the performance of dropout imputation and clustering methods for single-cell RNA sequencing data. Comput. Biol. Medicine 146: 105697 (2022) - [j29]Vincent Moulton
Posets and Spaces of $k$-Noncrossing RNA Structures. SIAM J. Discret. Math. 36(3): 1586-1611 (2022) - 2021
- [j28]Ben P. Tatman
Significance of differential allelic expression in phenotypic plasticity and evolutionary potential of microbial eukaryotes. Quant. Biol. 9(4): 400-410 (2021)
2010 – 2019
- 2019
- [j27]Katharina T. Huber, Vincent Moulton
Hierarchies from Lowest Stable Ancestors in Nonbinary Phylogenetic Networks. J. Classif. 36(2): 200-231 (2019) - [j26]Remie Janssen
Treewidth of display graphs: bounds, brambles and applications. J. Graph Algorithms Appl. 23(4): 715-743 (2019) - 2018
- [j25]Sarah Bastkowski
SPECTRE: a suite of phylogenetic tools for reticulate evolution. Bioinform. 34(6): 1056-1057 (2018) - [j24]Vincent Moulton
UPGMA and the normalized equidistant minimum evolution problem. Theor. Comput. Sci. 721: 1-15 (2018) - [j23]Steven Kelk, Georgios Stamoulis, Taoyang Wu
Treewidth distance on phylogenetic trees. Theor. Comput. Sci. 731: 99-117 (2018) - [i9]Remie Janssen, Mark Jones, Steven Kelk, Georgios Stamoulis, Taoyang Wu:
Treewidth of display graphs: bounds, brambles and applications. CoRR abs/1809.00907 (2018) - 2017
- [j22]Katharina T. Huber, Leo van Iersel, Vincent Moulton
Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets. Algorithmica 77(1): 173-200 (2017) - [j21]Vincent Moulton
A cubic-time algorithm for computing the trinet distance between level-1 networks. Inf. Process. Lett. 123: 36-41 (2017) - [i8]Leo van Iersel, Vincent Moulton, Eveline de Swart, Taoyang Wu:
Binets: fundamental building blocks for phylogenetic networks. CoRR abs/1701.08995 (2017) - [i7]Vincent Moulton, James Oldman, Taoyang Wu:
A cubic-time algorithm for computing the trinet distance between level-1 networks. CoRR abs/1703.05097 (2017) - [i6]Steven Kelk, Georgios Stamoulis, Taoyang Wu:
Treewidth distance on phylogenetic trees. CoRR abs/1703.10840 (2017) - [i5]Vincent Moulton, Andreas Spillner, Taoyang Wu:
UPGMA and the normalized equidistant minimum evolution problem. CoRR abs/1704.00497 (2017) - [i4]Katharina T. Huber, Vincent Moulton, Charles Semple, Taoyang Wu:
Quarnet inference rules for level-1 networks. CoRR abs/1711.06720 (2017) - 2016
- [j20]Sarah Bastkowski
The minimum evolution problem is hard: a link between tree inference and graph clustering problems. Bioinform. 32(4): 518-522 (2016) - [j19]Steven Kelk, Mareike Fischer
Reduction rules for the maximum parsimony distance on phylogenetic trees. Theor. Comput. Sci. 646: 1-15 (2016) - 2015
- [j18]Vincent Moulton
A parsimony-based metric for phylogenetic trees. Adv. Appl. Math. 66: 22-45 (2015) - [j17]Luca Penso Dolfin, Taoyang Wu
The combinatorics of tandem duplication. Discret. Appl. Math. 194: 1-22 (2015) - [j16]Sven Herrmann, Jack H. Koolen
Optimal realizations of two-dimensional, totally-decomposable metrics. Discret. Math. 338(8): 1289-1299 (2015) - [i3]Steven Kelk, Mareike Fischer, Vincent Moulton, Taoyang Wu:
Reduction rules for the maximum parsimony distance on phylogenetic trees. CoRR abs/1512.07459 (2015) - 2014
- [j15]Katharina T. Huber, Vincent Moulton
Representing Partitions on Trees. SIAM J. Discret. Math. 28(3): 1152-1172 (2014) - [i2]Katharina T. Huber, Leo van Iersel, Vincent Moulton, Céline Scornavacca, Taoyang Wu:
Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets. CoRR abs/1411.6804 (2014) - 2013
- [j14]Andreas W. M. Dress, Vincent Moulton
Obtaining splits from cut sets of tight spans. Discret. Appl. Math. 161(10-11): 1409-1420 (2013) - [j13]Peter J. Humphries, Taoyang Wu
On the Neighborhoods of Trees. IEEE ACM Trans. Comput. Biol. Bioinform. 10(3): 721-728 (2013) - [j12]Si Li, Kwok Pui Choi, Taoyang Wu
Maximum Likelihood Inference of the Evolutionary History of a PPI Network from the Duplication History of Its Proteins. IEEE ACM Trans. Comput. Biol. Bioinform. 10(6): 1412-1421 (2013) - [j11]Si Li, Kwok Pui Choi, Taoyang Wu
Degree distribution of large networks generated by the partial duplication model. Theor. Comput. Sci. 476: 94-108 (2013) - [c4]Yu Zheng, Taoyang Wu
A Linear-Time Algorithm for Reconciliation of Non-binary Gene Tree and Binary Species Tree. COCOA 2013: 190-201 - 2012
- [j10]Jack H. Koolen
Injective optimal realizations of finite metric spaces. Discret. Math. 312(10): 1602-1610 (2012) - [c3]Si Li, Kwok Pui Choi, Taoyang Wu
Reconstruction of Network Evolutionary History from Extant Network Topology and Duplication History. ISBRA 2012: 165-176 - 2011
- [j9]Taoyang Wu
Structural properties of the reconciliation space and their applications in enumerating nearly-optimal reconciliations between a gene tree and a species tree. BMC Bioinform. 12(S-9): S7 (2011) - [j8]László A. Székely, Hua Wang, Taoyang Wu
The sum of the distances between the leaves of a tree and the 'semi-regular' property. Discret. Math. 311(13): 1197-1203 (2011) - [c2]Louxin Zhang, Yen Kaow Ng
Network model and efficient method for detecting relative duplications or horizontal gene transfers. ICCABS 2011: 214-219 - 2010
- [j7]Andreas W. M. Dress, Taoyang Wu
A note on single-linkage equivalence. Appl. Math. Lett. 23(4): 432-435 (2010) - [j6]Peter J. Cameron
The complexity of the weight problem for permutation and matrix groups. Discret. Math. 310(3): 408-416 (2010)
2000 – 2009
- 2009
- [j5]Andreas W. M. Dress, Vincent Moulton
Barriers in metric spaces. Appl. Math. Lett. 22(8): 1150-1153 (2009) - [j4]Christoph Buchheim
On the subgroup distance problem. Discret. Math. 309(4): 962-968 (2009) - [j3]Taoyang Wu
On the guessing number of shift graphs. J. Discrete Algorithms 7(2): 220-226 (2009) - [j2]Taoyang Wu
Refining Phylogenetic Trees Given Additional Data: An Algorithm Based on Parsimony. IEEE ACM Trans. Comput. Biol. Bioinform. 6(1): 118-125 (2009) - 2007
- [j1]Peter J. Cameron
The complexity of the Weight Problem for permutation groups. Electron. Notes Discret. Math. 28: 109-116 (2007) - 2006
- [c1]Taoyang Wu:
Extremal Sequence Theory. ACiD 2006: 159 - [i1]Christoph Buchheim, Peter J. Cameron, Taoyang Wu:
On the Subgroup Distance Problem. Electron. Colloquium Comput. Complex. TR06 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: