S. J. Willson

发表

A Higher Order Parsimony Method to Reduce Long-Branch Attraction

Stephen J. Willson, S. J. Willson, 1999 .

Comparing and Simplifying Distinct-Cluster Phylogenetic Networks

S. J. Willson, 2015, 1501.07528.

Robustness of Topological Supertree Methods for Reconciling Dense Incompatible Data

S. J. Willson, 2009, TCBB.

Restricted Trees: Simplifying Networks with Bottlenecks

S. J. Willson, 2010, Bulletin of mathematical biology.

Relationships Among Phylogenetic Networks

S. J. Willson, 2010 .

Growth rates and fractional dimensions in cellular automata

Stephen J. Willson, S. J. Willson, 1984 .

Minimum evolution using ordinary least-squares is less robust than neighbor-joining

S. J. Willson, 2005, Bulletin of mathematical biology.

Properties of Normal Phylogenetic Networks

Stephen J. Willson, S. J. Willson, Stephen J Willson, 2010, Bulletin of mathematical biology.

Reconstruction of certain phylogenetic networks from the genomes at their leaves.

S. J. Willson, 2008, Journal of theoretical biology.

Long-Term Behavior in the Theory of Moves

Stephen J. Willson, S. J. Willson, 1998 .

Distinct-Cluster Tree-Child Phylogenetic Networks and Possible Uses to Study Polyploidy

S. J. Willson, 2022, Bulletin of Mathematical Biology.

Comparing and Simplifying Distinct-Cluster Phylogenetic Networks

S. J. Willson, 2016, Annals of Combinatorics.

Distinct-Cluster Tree-Child Phylogenetic Networks and Possible Uses to Study Polyploidy

S. J. Willson, 2022, Bulletin of Mathematical Biology.

Robustness of Topological Supertree Methods for Reconciling Dense Incompatible Data

Stephen J. Willson, S. J. Willson, 2009, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

Reconstruction of Certain Phylogenetic Networks from Their Tree-Average Distances

Stephen J. Willson, S. J. Willson, Stephen J Willson, 2013, Bulletin of Mathematical Biology.

Tree-average distances on certain phylogenetic networks have their weights uniquely determined

Stephen J. Willson, S. J. Willson, 2012, Algorithms for Molecular Biology.

Unique Solvability of Certain Hybrid Networks from Their Distances

Stephen J. Willson, S. J. Willson, 2006 .

Unique Reconstruction of Tree-Like Phylogenetic Networks from Distances Between Leaves

S. J. Willson, Stephen J Willson, 2006, Bulletin of mathematical biology.

Consistent formulas for estimating the total lengths of trees

Stephen J. Willson, S. J. Willson, 2005, Discret. Appl. Math..

An error-correcting map for quartets can improve the signals for phylogenetic trees.

S. J. Willson, S J Willson, 2001, Molecular biology and evolution.

Graph-based evolutionary algorithms

Daniel A. Ashlock, Steven M. Corns, Kenneth Mark Bryden, 2006, IEEE Transactions on Evolutionary Computation.

CSD Homomorphisms between Phylogenetic Networks

Stephen J. Willson, S. J. Willson, 2010, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

Unique Determination of Some Homoplasies at Hybridization Events

Stephen J. Willson, S. J. Willson, Stephen J Willson, 2007, Bulletin of mathematical biology.

Reconstruction of Certain Phylogenetic Networks from Their Tree-Average Distances

S. J. Willson, 2013, Bulletin of Mathematical Biology.

Axioms for the outcomes of negotiation in matrix games

Stephen J. Willson, S. J. Willson, 2000, Math. Soc. Sci..

A value for partially defined cooperative games

Stephen J. Willson, S. J. Willson, 1993 .

Merging Arcs to Produce Acyclic Phylogenetic Networks and Normal Networks

S. J. Willson, 2022, Bulletin of mathematical biology.

The growth of configurations

Stephen J. Willson, S. J. Willson, 1976, Mathematical systems theory.

On the ergodic theory of cellular automata

Stephen J. Willson, S. J. Willson, 1975, Mathematical systems theory.

Equivariant homology theories on $G$-complexes

S. J. Willson, 1975 .

Cellular automata can generate fractals

Stephen J. Willson, S. J. Willson, 1984, Discret. Appl. Math..

Constructing rooted supertrees using distances

S. J. Willson, Stephen J Willson, 2004, Bulletin of mathematical biology.

Equivariant maps between representation spheres.

S. J. Willson, 1975 .

Money-egalitarian-equivalent and gain-maximin allocations of indivisible items with monetary compensation

Stephen J. Willson, S. J. Willson, 2003, Soc. Choice Welf..

Robustness of supertree methods for reconciling dense incompatible data

Stephen J. Willson, S. J. Willson, 2007 .

Robustness of Topological Supertree Methods for Reconciling Dense Incompatible Data

S. J. Willson, 2009, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

Building Phylogenetic Trees from Quartets by Using Local Inconsistency Measures

Stephen J. Willson, S. J. Willson, 1999 .

Calculating growth rates and moments for additive cellular automata

Stephen J. Willson, S. J. Willson, 1991, Discret. Appl. Math..

A USE OF CELLULAR AUTOMATA TO OBTAIN FAMILIES OF FRACTALS

Stephen J. Willson, S. J. Willson, 1986 .