Katherine St. John

Maria Luisa Bonet, Simone Linz, Katherine St. John: The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility. IEEE/ACM Trans. Comput. Biology Bioinform. 9(1): 273-285 (2012)

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

Maria Luisa Bonet, Simone Linz, Katherine St. John: The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility. CoRR abs/1101.2170 (2011)

Sean Cleary, Katherine St. John: A Linear-Time Approximation Algorithm for Rotation Distance. J. Graph Algorithms Appl. 14(2): 385-390 (2010)

Maria Luisa Bonet, Katherine St. John: On the Complexity of uSPR Distance. IEEE/ACM Trans. Comput. Biology Bioinform. 7(3): 572-576 (2010)

Balaji Venkatachalam, Jim Apple, Katherine St. John, Dan Gusfield: Untangling Tanglegrams: Comparing Trees by Their Drawings. IEEE/ACM Trans. Comput. Biology Bioinform. 7(4): 588-597 (2010)

Sean Cleary, Katherine St. John: Rotation distance is fixed-parameter tractable. Inf. Process. Lett. 109(16): 918-922 (2009)

Balaji Venkatachalam, Jim Apple, Katherine St. John, Dan Gusfield: Untangling Tanglegrams: Comparing Trees by Their Drawings. ISBRA 2009: 88-99

Maria Luisa Bonet, Katherine St. John: Efficiently Calculating Evolutionary Tree Measures Using SAT. SAT 2009: 4-17

Sean Cleary, Katherine St. John: Rotation Distance is Fixed-Parameter Tractable. CoRR abs/0903.0197 (2009)

Sean Cleary, Katherine St. John: A Linear-Time Approximation Algorithm for Rotation Distance. CoRR abs/0903.0199 (2009)

Joel H. Spencer, Katherine St. John: The complexity of random ordered structures. Ann. Pure Appl. Logic 152(1-3): 174-179 (2008)

Nina Amenta, Matthew Godwin, Nicolay Postarnakevich, Katherine St. John: Approximating geodesic tree distance. Inf. Process. Lett. 103(2): 61-65 (2007)

Joel H. Spencer, Katherine St. John: The Complexity of Random Ordered Structures. Electr. Notes Theor. Comput. Sci. 143: 197-206 (2006)

Maria Luisa Bonet, Katherine St. John, Ruchi Mahindru, Nina Amenta: Approximating Subtree Distances Between Phylogenies. Journal of Computational Biology 13(8): 1419-1434 (2006)

Luay Nakhleh, Tandy Warnow, C. Randal Linder, Katherine St. John: Reconstructing Reticulate Evolution in SpeciesTheory and Practice. Journal of Computational Biology 12(6): 796-811 (2005)

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: Evolutionary Morphing. IEEE Visualization 2005: 55

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

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

Nina Amenta, Frederick Clarke, Katherine St. John: A Linear-Time Majority Tree Algorithm. WABI 2003: 216-227

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

Joel H. Spencer, Katherine St. John: The Tenacity of Zero-One Laws. Electr. J. Comb. 8(2) (2001)

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

Tandy Warnow, Bernard M. E. Moret, Katherine St. John: Absolute convergence: true trees from short sequences. SODA 2001: 186-195

Katherine St. John, Tandy Warnow, Bernard M. E. Moret, Lisa Vawter: Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining. SODA 2001: 196-205

Luay Nakhleh, Usman Roshan, Katherine St. John, Jerry Sun, Tandy Warnow: The Performance of Phylogenetic Methods on Trees of Bounded Diameter. WABI 2001: 214-226

Joel Spencer, Katherine St. John: Random unary predicates: Almost sure theories and countable models. Random Struct. Algorithms 13(3-4): 229-248 (1998)

Joel Spencer, Katherine St. John: Random Sparse Bit Strings at the Threshold of Adjacency. STACS 1998: 94-104

Katherine St. John: Limit Probabilities for Random Sparse Bit Strings. Electr. J. Comb. 4(1) (1997)