Limit Probabilities for Random Sparse Bit Strings. - Katherine St. John (Electron. J. Comb., 1997)

Random Sparse Bit Strings at the Threshold of Adjacency. - Joel Spencer; Katherine St. John (STACS, 1998)

Random unary predicates: Almost sure theories and countable models. - Joel Spencer; Katherine St. John (Random Struct. Algorithms, 1998)

Designing fast converging phylogenetic methods. - Luay Nakhleh; Usman Roshan; Katherine St. John; Jerry Sun 001; Tandy J. Warnow (ISMB (Supplement of Bioinformatics), 2001)

Absolute convergence: true trees from short sequences. - Tandy J. Warnow; Bernard M. E. Moret; Katherine St. John (SODA, 2001)

The Performance of Phylogenetic Methods on Trees of Bounded Diameter. - Luay Nakhleh; Usman Roshan; Katherine St. John; Jerry Sun 001; Tandy J. Warnow (WABI, 2001)

The Tenacity of Zero-One Laws. - Joel H. Spencer; Katherine St. John (Electron. J. Comb., 2001)

The Accuracy of Fast Phylogenetic Methods for Large Datasets. - Luay Nakhleh; Bernard M. E. Moret; Usman Roshan; Katherine St. John; Jerry Sun 001; Tandy J. Warnow (Pacific Symposium on Biocomputing, 2002)

A Linear-Time Majority Tree Algorithm. - Nina Amenta; Frederick Clarke; Katherine St. John (WABI, 2003)

Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining. - Katherine St. John; Tandy J. Warnow; Bernard M. E. Moret; Lisa Vawter (J. Algorithms, 2003)

SequenceJuxtaposer: Fluid Navigation For Large-Scale Sequence Comparison in Context. - James Slack 001; Kristian Hildebrand; Tamara Munzner; Katherine St. John (German Conference on Bioinformatics, 2004)

Evolutionary Morphing. - David F. Wiley; Nina Amenta; Dan A. Alcantara; Deboshmita Ghosh; Yong Joo Kil; Eric Delson; Will Harcourt-Smith; Katherine St. John; F. James Rohlf; Bernd Hamann (IEEE Visualization, 2005)

The Complexity of Random Ordered Structures. - Joel H. Spencer; Katherine St. John (WoLLIC, 2005)

Reconstructing Reticulate Evolution in SpeciesTheory and Practice. - Luay Nakhleh; Tandy J. Warnow; C. Randal Linder; Katherine St. John (J. Comput. Biol., 2005)

Approximating Subtree Distances Between Phylogenies. - Maria Luisa Bonet; Katherine St. John; Ruchi Mahindru; Nina Amenta (J. Comput. Biol., 2006)

Approximating geodesic tree distance. - Nina Amenta; Matthew Godwin; Nicolay Postarnakevich; Katherine St. John (Inf. Process. Lett., 2007)

Efficiently Calculating Evolutionary Tree Measures Using SAT. - Maria Luisa Bonet; Katherine St. John (SAT, 2009)

Rotation distance is fixed-parameter tractable. - Sean Cleary; Katherine St. John (Inf. Process. Lett., 2009)

A Linear-Time Approximation Algorithm for Rotation Distance. - Sean Cleary; Katherine St. John (J. Graph Algorithms Appl., 2010)

On the Complexity of uSPR Distance. - Maria Luisa Bonet; Katherine St. John (IEEE ACM Trans. Comput. Biol. Bioinform., 2010)

Untangling Tanglegrams: Comparing Trees by Their Drawings. - Balaji Venkatachalam; Jim Apple; Katherine St. John; Dan Gusfield (IEEE ACM Trans. Comput. Biol. Bioinform., 2010)

Walks in phylogenetic treespace. - Alan Joseph J. Caceres; Samantha Daley; John DeJesus; Michael Hintze; Diquan Moore; Katherine St. John (Inf. Process. Lett., 2011)

The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility. - Maria Luisa Bonet; Simone Linz; Katherine St. John (IEEE ACM Trans. Comput. Biol. Bioinform., 2012)

Counting Trees in a Phylogenetic Network Is #P-Complete. - Simone Linz; Katherine St. John; Charles Semple (SIAM J. Comput., 2013)

Walks on SPR Neighborhoods. - Alan Joseph J. Caceres; Juan Castillo; Jinnie Lee; Katherine St. John (IEEE ACM Trans. Comput. Biol. Bioinform., 2013)

Hamiltonian Walks of Phylogenetic Treespaces. - Kevaughn Gordon; Eric Ford; Katherine St. John (IEEE ACM Trans. Comput. Biol. Bioinform., 2013)

Optimizing tree and character compatibility across several phylogenetic trees. - Simone Linz; Katherine St. John; Charles Semple (Theor. Comput. Sci., 2013)

Bounds on the Expected Size of the Maximum Agreement Subtree. - Daniel Irving Bernstein; Lam Si Tung Ho; Colby Long; Mike A. Steel; Katherine St. John; Seth Sullivant (SIAM J. Discret. Math., 2015)

On Determining if Tree-based Networks Contain Fixed Trees. - Maria Anaya; Olga Anipchenko-Ulaj; Aisha Ashfaq; Joyce Chiu; Mahedi Kaiser; Max Shoji Ohsawa; Megan Owen; Ella Pavlechko; Katherine St. John; Shivam Suleria; Keith Thompson; Corrine Yap (CoRR, 2016)

Properties for the Fréchet mean in Billera-Holmes-Vogtmann treespace. - Maria Anaya; Olga Anipchenko-Ulaj; Aisha Ashfaq; Joyce Chiu; Mahedi Kaiser; Max Shoji Ohsawa; Megan Owen; Ella Pavlechko; Katherine St. John; Shivam Suleria; Keith Thompson; Corrine Yap (Adv. Appl. Math., 2020)

Covering Tree-Based Phylogenetic Networks. - Nathan Davidov; Amanda Hernandez; Justin Jian; Patrick McKenna; K. A. Medlin; Roadra Mojumder; Megan Owen; Andrew Quijano; Amanda Rodriguez; Katherine St. John; Katherine Thai; Meliza Uraga (CoRR, 2020)

Maximum Covering Subtrees for Phylogenetic Networks. - Nathan Davidov; Amanda Hernandez; Justin Jian; Patrick McKenna; K. A. Medlin; Roadra Mojumder; Megan Owen; Andrew Quijano; Amanda Rodriguez; Katherine St. John; Katherine Thai; Meliza Uraga (IEEE ACM Trans. Comput. Biol. Bioinform., 2021)

On the Maximum Agreement Subtree Conjecture for Balanced Trees. - Magnus Bordewich; Simone Linz; Megan Owen; Katherine St. John; Charles Semple; Kristina Wicke (SIAM J. Discret. Math., 2022)