default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKatherine St. John
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j22]Magnus Bordewich
, Simone Linz, Megan Owen, Katherine St. John, Charles Semple, Kristina Wicke:
On the Maximum Agreement Subtree Conjecture for Balanced Trees. SIAM J. Discret. Math. 36(1): 336-354 (2022)- 2021
- [j21]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:
Maximum Covering Subtrees for Phylogenetic Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 18(6): 2823-2827 (2021) - 2020
- [j20]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:
Properties for the Fréchet mean in Billera-Holmes-Vogtmann treespace. Adv. Appl. Math. 120: 102072 (2020) - [i6]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:
Covering Tree-Based Phylogenetic Networks. CoRR abs/2009.12413 (2020)
2010 – 2019
- 2016
- [i5]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:
On Determining if Tree-based Networks Contain Fixed Trees. CoRR abs/1602.02739 (2016) - 2015
- [j19]Daniel Irving Bernstein, Lam Si Tung Ho, Colby Long, Mike A. Steel, Katherine St. John, Seth Sullivant:
Bounds on the Expected Size of the Maximum Agreement Subtree. SIAM J. Discret. Math. 29(4): 2065-2074 (2015) - 2014
- [i4]Daniel Irving Bernstein, Lam Si Tung Ho, Colby Long, Mike A. Steel, Katherine St. John, Seth Sullivant:
Bounds on the Expected Size of the Maximum Agreement Subtree. CoRR abs/1411.7338 (2014) - 2013
- [j18]Simone Linz, Katherine St. John, Charles Semple:
Counting Trees in a Phylogenetic Network Is \#P-Complete. SIAM J. Comput. 42(4): 1768-1776 (2013) - [j17]Alan Joseph J. Caceres, Juan Castillo, Jinnie Lee, Katherine St. John:
Walks on SPR Neighborhoods. IEEE ACM Trans. Comput. Biol. Bioinform. 10(1): 236-239 (2013) - [j16]Kevaughn Gordon, Eric Ford, Katherine St. John:
Hamiltonian Walks of Phylogenetic Treespaces. IEEE ACM Trans. Comput. Biol. Bioinform. 10(4): 1076-1079 (2013) - [j15]Simone Linz, Katherine St. John, Charles Semple:
Optimizing tree and character compatibility across several phylogenetic trees. Theor. Comput. Sci. 513: 129-136 (2013) - 2012
- [j14]Maria Luisa Bonet, Simone Linz, Katherine St. John:
The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility. IEEE ACM Trans. Comput. Biol. Bioinform. 9(1): 273-285 (2012) - 2011
- [j13]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) - [i3]Maria Luisa Bonet, Simone Linz, Katherine St. John:
The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility. CoRR abs/1101.2170 (2011) - 2010
- [j12]Sean Cleary, Katherine St. John:
A Linear-Time Approximation Algorithm for Rotation Distance. J. Graph Algorithms Appl. 14(2): 385-390 (2010) - [j11]Maria Luisa Bonet, Katherine St. John:
On the Complexity of uSPR Distance. IEEE ACM Trans. Comput. Biol. Bioinform. 7(3): 572-576 (2010) - [j10]Balaji Venkatachalam, Jim Apple, Katherine St. John, Dan Gusfield:
Untangling Tanglegrams: Comparing Trees by Their Drawings. IEEE ACM Trans. Comput. Biol. Bioinform. 7(4): 588-597 (2010)
2000 – 2009
- 2009
- [j9]Sean Cleary, Katherine St. John:
Rotation distance is fixed-parameter tractable. Inf. Process. Lett. 109(16): 918-922 (2009) - [c12]Balaji Venkatachalam, Jim Apple, Katherine St. John, Dan Gusfield:
Untangling Tanglegrams: Comparing Trees by Their Drawings. ISBRA 2009: 88-99 - [c11]Maria Luisa Bonet, Katherine St. John:
Efficiently Calculating Evolutionary Tree Measures Using SAT. SAT 2009: 4-17 - [i2]Sean Cleary, Katherine St. John:
Rotation Distance is Fixed-Parameter Tractable. CoRR abs/0903.0197 (2009) - [i1]Sean Cleary, Katherine St. John:
A Linear-Time Approximation Algorithm for Rotation Distance. CoRR abs/0903.0199 (2009) - 2008
- [j8]Joel H. Spencer, Katherine St. John:
The complexity of random ordered structures. Ann. Pure Appl. Log. 152(1-3): 174-179 (2008) - 2007
- [j7]Nina Amenta, Matthew Godwin, Nicolay Postarnakevich, Katherine St. John:
Approximating geodesic tree distance. Inf. Process. Lett. 103(2): 61-65 (2007) - 2006
- [j6]Maria Luisa Bonet, Katherine St. John, Ruchi Mahindru, Nina Amenta:
Approximating Subtree Distances Between Phylogenies. J. Comput. Biol. 13(8): 1419-1434 (2006) - 2005
- [j5]Luay Nakhleh, Tandy J. Warnow, C. Randal Linder, Katherine St. John:
Reconstructing Reticulate Evolution in SpeciesTheory and Practice. J. Comput. Biol. 12(6): 796-811 (2005) - [c10]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: 431-438 - [c9]Joel H. Spencer, Katherine St. John:
The Complexity of Random Ordered Structures. WoLLIC 2005: 197-206 - 2004
- [c8]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-41 - 2003
- [j4]Katherine St. John, Tandy J. 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) - [c7]Nina Amenta, Frederick Clarke, Katherine St. John:
A Linear-Time Majority Tree Algorithm. WABI 2003: 216-227 - 2002
- [c6]Luay Nakhleh, Bernard M. E. Moret, Usman Roshan, Katherine St. John, Jerry Sun, Tandy J. Warnow:
The Accuracy of Fast Phylogenetic Methods for Large Datasets. Pacific Symposium on Biocomputing 2002: 211-222 - 2001
- [j3]Joel H. Spencer, Katherine St. John:
The Tenacity of Zero-One Laws. Electron. J. Comb. 8(2) (2001) - [c5]Luay Nakhleh, Usman Roshan, Katherine St. John, Jerry Sun, Tandy J. Warnow:
Designing fast converging phylogenetic methods. ISMB (Supplement of Bioinformatics) 2001: 190-198 - [c4]Tandy J. Warnow, Bernard M. E. Moret, Katherine St. John:
Absolute convergence: true trees from short sequences. SODA 2001: 186-195 - [c3]Katherine St. John, Tandy J. Warnow, Bernard M. E. Moret, Lisa Vawter:
Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining. SODA 2001: 196-205 - [c2]Luay Nakhleh, Usman Roshan, Katherine St. John, Jerry Sun, Tandy J. Warnow:
The Performance of Phylogenetic Methods on Trees of Bounded Diameter. WABI 2001: 214-226
1990 – 1999
- 1998
- [j2]Joel Spencer, Katherine St. John:
Random unary predicates: Almost sure theories and countable models. Random Struct. Algorithms 13(3-4): 229-248 (1998) - [c1]Joel Spencer, Katherine St. John:
Random Sparse Bit Strings at the Threshold of Adjacency. STACS 1998: 94-104 - 1997
- [j1]Katherine St. John:
Limit Probabilities for Random Sparse Bit Strings. Electron. J. Comb. 4(1) (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
