Taoyang Wu

Orcid: 0000-0002-2663-2001

According to our database1, Taoyang Wu authored at least 38 papers between 2006 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Planar Rooted Phylogenetic Networks.
IEEE ACM Trans. Comput. Biol. Bioinform., 2023

Encoding and ordering <i>X</i>-cactuses.
Adv. Appl. Math., 2023

2022
Posets and Spaces of $k$-Noncrossing RNA Structures.
SIAM J. Discret. Math., 2022

Evaluating the performance of dropout imputation and clustering methods for single-cell RNA sequencing data.
Comput. Biol. Medicine, 2022

2021
Significance of differential allelic expression in phenotypic plasticity and evolutionary potential of microbial eukaryotes.
Quant. Biol., December, 2021

2019
Treewidth of display graphs: bounds, brambles and applications.
J. Graph Algorithms Appl., 2019

Hierarchies from Lowest Stable Ancestors in Nonbinary Phylogenetic Networks.
J. Classif., 2019

2018
UPGMA and the normalized equidistant minimum evolution problem.
Theor. Comput. Sci., 2018

Treewidth distance on phylogenetic trees.
Theor. Comput. Sci., 2018

SPECTRE: a suite of phylogenetic tools for reticulate evolution.
Bioinform., 2018

2017
A cubic-time algorithm for computing the trinet distance between level-1 networks.
Inf. Process. Lett., 2017

Quarnet inference rules for level-1 networks.
CoRR, 2017

Binets: fundamental building blocks for phylogenetic networks.
CoRR, 2017

Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets.
Algorithmica, 2017

2016
Reduction rules for the maximum parsimony distance on phylogenetic trees.
Theor. Comput. Sci., 2016

The minimum evolution problem is hard: a link between tree inference and graph clustering problems.
Bioinform., 2016

2015
Optimal realizations of two-dimensional, totally-decomposable metrics.
Discret. Math., 2015

The combinatorics of tandem duplication.
Discret. Appl. Math., 2015

A parsimony-based metric for phylogenetic trees.
Adv. Appl. Math., 2015

2014
Representing Partitions on Trees.
SIAM J. Discret. Math., 2014

2013
Degree distribution of large networks generated by the partial duplication model.
Theor. Comput. Sci., 2013

Maximum Likelihood Inference of the Evolutionary History of a PPI Network from the Duplication History of Its Proteins.
IEEE ACM Trans. Comput. Biol. Bioinform., 2013

On the Neighborhoods of Trees.
IEEE ACM Trans. Comput. Biol. Bioinform., 2013

Obtaining splits from cut sets of tight spans.
Discret. Appl. Math., 2013

A Linear-Time Algorithm for Reconciliation of Non-binary Gene Tree and Binary Species Tree.
Proceedings of the Combinatorial Optimization and Applications, 2013

2012
Injective optimal realizations of finite metric spaces.
Discret. Math., 2012

Reconstruction of Network Evolutionary History from Extant Network Topology and Duplication History.
Proceedings of the Bioinformatics Research and Applications - 8th International Symposium, 2012

2011
The sum of the distances between the leaves of a tree and the 'semi-regular' property.
Discret. Math., 2011

Structural properties of the reconciliation space and their applications in enumerating nearly-optimal reconciliations between a gene tree and a species tree.
BMC Bioinform., 2011

Network model and efficient method for detecting relative duplications or horizontal gene transfers.
Proceedings of the IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences, 2011

2010
The complexity of the weight problem for permutation and matrix groups.
Discret. Math., 2010

A note on single-linkage equivalence.
Appl. Math. Lett., 2010

2009
Refining Phylogenetic Trees Given Additional Data: An Algorithm Based on Parsimony.
IEEE ACM Trans. Comput. Biol. Bioinform., 2009

On the guessing number of shift graphs.
J. Discrete Algorithms, 2009

Barriers in metric spaces.
Appl. Math. Lett., 2009

2007
The complexity of the Weight Problem for permutation groups.
Electron. Notes Discret. Math., 2007

2006
On the Subgroup Distance Problem.
Electron. Colloquium Comput. Complex., 2006

Extremal Sequence Theory.
Proceedings of the Algorithms and Complexity in Durham 2006, 2006


  Loading...