Katherine St. John

	2012
29		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)
	2011
28		Maria Luisa Bonet, Simone Linz, Katherine St. John: The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility CoRR abs/1101.2170: (2011)
27		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)
	2010
26		Maria Luisa Bonet, Katherine St. John: On the Complexity of uSPR Distance. IEEE/ACM Trans. Comput. Biology Bioinform. 7(3): 572-576 (2010)
25		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)
24		Sean Cleary, Katherine St. John: A Linear-Time Approximation Algorithm for Rotation Distance. J. Graph Algorithms Appl. 14(2): 385-390 (2010)
	2009
23		Balaji Venkatachalam, Jim Apple, Katherine St. John, Dan Gusfield: Untangling Tanglegrams: Comparing Trees by Their Drawings. ISBRA 2009: 88-99
22		Maria Luisa Bonet, Katherine St. John: Efficiently Calculating Evolutionary Tree Measures Using SAT. SAT 2009: 4-17
21		Sean Cleary, Katherine St. John: Rotation Distance is Fixed-Parameter Tractable CoRR abs/0903.0197: (2009)
20		Sean Cleary, Katherine St. John: A Linear-Time Approximation Algorithm for Rotation Distance CoRR abs/0903.0199: (2009)
19		Sean Cleary, Katherine St. John: Rotation distance is fixed-parameter tractable. Inf. Process. Lett. 109(16): 918-922 (2009)
	2008
18		Joel H. Spencer, Katherine St. John: The complexity of random ordered structures. Ann. Pure Appl. Logic 152(1-3): 174-179 (2008)
	2007
17		Nina Amenta, Matthew Godwin, Nicolay Postarnakevich, Katherine St. John: Approximating geodesic tree distance. Inf. Process. Lett. 103(2): 61-65 (2007)
	2006
16		Joel H. Spencer, Katherine St. John: The Complexity of Random Ordered Structures. Electr. Notes Theor. Comput. Sci. 143: 197-206 (2006)
15		Maria Luisa Bonet, Katherine St. John, Ruchi Mahindru, Nina Amenta: Approximating Subtree Distances Between Phylogenies. Journal of Computational Biology 13(8): 1419-1434 (2006)
	2005
14		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
13		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)
	2004
12		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
	2003
11		Nina Amenta, Frederick Clarke, Katherine St. John: A Linear-Time Majority Tree Algorithm. WABI 2003: 216-227
10		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)
	2002
9		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
	2001
8		Luay Nakhleh, Usman Roshan, Katherine St. John, Jerry Sun, Tandy Warnow: Designing fast converging phylogenetic methods. ISMB (Supplement of Bioinformatics) 2001: 190-198
7		Tandy Warnow, Bernard M. E. Moret, Katherine St. John: Absolute convergence: true trees from short sequences. SODA 2001: 186-195
6		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
5		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
4		Joel H. Spencer, Katherine St. John: The Tenacity of Zero-One Laws. Electr. J. Comb. 8(2): (2001)
	1998
3		Joel Spencer, Katherine St. John: Random Sparse Bit Strings at the Threshold of Adjacency. STACS 1998: 94-104
2		Joel Spencer, Katherine St. John: Random unary predicates: Almost sure theories and countable models. Random Struct. Algorithms 13(3-4): 229-248 (1998)
	1997
1		Katherine St. John: Limit Probabilities for Random Sparse Bit Strings. Electr. J. Comb. 4(1): (1997)

Coauthor Index

1	Dan A. Alcantara	[14]
2	Nina Amenta	[11] [14] [15] [17]
3	Jim Apple	[23] [25]
4	Maria Luisa Bonet	[15] [22] [26] [28] [29]
5	Alan Joseph J. Caceres	[27]
6	Frederick Clarke	[11]
7	Sean Cleary	[19] [20] [21] [24]
8	Samantha Daley	[27]
9	John DeJesus	[27]
10	Eric Delson	[14]
11	Deboshmita Ghosh	[14]
12	Matthew Godwin	[17]
13	Dan Gusfield	[23] [25]
14	Bernd Hamann	[14]
15	Will Harcourt-Smith	[14]
16	Kristian Hildebrand	[12]
17	Michael Hintze	[27]
18	Yong Joo Kil	[14]
19	C. Randal Linder	[13]
20	Simone Linz	[28] [29]
21	Ruchi Mahindru	[15]
22	Diquan Moore	[27]
23	Bernard M. E. Moret	[6] [7] [9] [10]
24	Tamara Munzner	[12]
25	Luay Nakhleh	[5] [8] [9] [13]
26	Nicolay Postarnakevich	[17]
27	F. James Rohlf	[14]
28	Usman Roshan	[5] [8] [9]
29	James Slack	[12]
30	Joel H. Spencer (Joel Spencer)	[2] [3] [4] [16] [18]
31	Jerry Sun	[5] [8] [9]
32	Lisa Vawter	[6] [10]
33	Balaji Venkatachalam	[23] [25]
34	Tandy Warnow	[5] [6] [7] [8] [9] [10] [13]
35	David F. Wiley	[14]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page