Katherine St. John

Orcid: 0000-0003-1657-8301

According to our database1, Katherine St. John authored at least 33 papers between 1997 and 2022.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
On the Maximum Agreement Subtree Conjecture for Balanced Trees.
SIAM J. Discret. Math., 2022

2021
Maximum Covering Subtrees for Phylogenetic Networks.
IEEE ACM Trans. Comput. Biol. Bioinform., 2021

2020
Covering Tree-Based Phylogenetic Networks.
CoRR, 2020

Properties for the Fréchet mean in Billera-Holmes-Vogtmann treespace.
Adv. Appl. Math., 2020

2016
On Determining if Tree-based Networks Contain Fixed Trees.
CoRR, 2016

2015
Bounds on the Expected Size of the Maximum Agreement Subtree.
SIAM J. Discret. Math., 2015

2013
Optimizing tree and character compatibility across several phylogenetic trees.
Theor. Comput. Sci., 2013

Hamiltonian Walks of Phylogenetic Treespaces.
IEEE ACM Trans. Comput. Biol. Bioinform., 2013

Walks on SPR Neighborhoods.
IEEE ACM Trans. Comput. Biol. Bioinform., 2013

Counting Trees in a Phylogenetic Network Is \#P-Complete.
SIAM J. Comput., 2013

2012
The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility.
IEEE ACM Trans. Comput. Biol. Bioinform., 2012

2011
Walks in phylogenetic treespace.
Inf. Process. Lett., 2011

2010
Untangling Tanglegrams: Comparing Trees by Their Drawings.
IEEE ACM Trans. Comput. Biol. Bioinform., 2010

On the Complexity of uSPR Distance.
IEEE ACM Trans. Comput. Biol. Bioinform., 2010

A Linear-Time Approximation Algorithm for Rotation Distance.
J. Graph Algorithms Appl., 2010

2009
Rotation distance is fixed-parameter tractable.
Inf. Process. Lett., 2009

Efficiently Calculating Evolutionary Tree Measures Using SAT.
Proceedings of the Theory and Applications of Satisfiability Testing, 2009

2007
Approximating geodesic tree distance.
Inf. Process. Lett., 2007

2006
Approximating Subtree Distances Between Phylogenies.
J. Comput. Biol., 2006

2005
Reconstructing Reticulate Evolution in SpeciesTheory and Practice.
J. Comput. Biol., 2005

The Complexity of Random Ordered Structures.
Proceedings of the 12th Workshop on Logic, Language, Information and Computation, 2005

Evolutionary Morphing.
Proceedings of the 16th IEEE Visualization Conference, 2005

2004
SequenceJuxtaposer: Fluid Navigation For Large-Scale Sequence Comparison in Context.
Proceedings of the German Conference on Bioinformatics (GCB 2004), Bielefeld, 2004

2003
Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining.
J. Algorithms, 2003

A Linear-Time Majority Tree Algorithm.
Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

2002
The Accuracy of Fast Phylogenetic Methods for Large Datasets.
Proceedings of the 7th Pacific Symposium on Biocomputing, 2002

2001
The Tenacity of Zero-One Laws.
Electron. J. Comb., 2001

The Performance of Phylogenetic Methods on Trees of Bounded Diameter.
Proceedings of the Algorithms in Bioinformatics, First International Workshop, 2001

Absolute convergence: true trees from short sequences.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Designing fast converging phylogenetic methods.
Proceedings of the Ninth International Conference on Intelligent Systems for Molecular Biology, 2001

1998
Random unary predicates: Almost sure theories and countable models.
Random Struct. Algorithms, 1998

Random Sparse Bit Strings at the Threshold of Adjacency.
Proceedings of the STACS 98, 1998

1997
Limit Probabilities for Random Sparse Bit Strings.
Electron. J. Comb., 1997


  Loading...