default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSeth Sullivant
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j33]Cashous Bortner
, Elizabeth Gross, Nicolette Meshkat, Anne Shiu, Seth Sullivant:
Identifiability of linear compartmental tree models and a general formula for input-output equations. Adv. Appl. Math. 146: 102490 (2023)- [j32]Jane Ivy Coons, Seth Sullivant:
The $h^*$-Polynomial of the Order Polytope of the Zig-Zag Poset. Electron. J. Comb. 30(2) (2023) - [j31]Caprice Stanley, Seth Sullivant:
On mixing behavior of a family of random walks determined by a linear recurrence. Discret. Math. 346(1): 113166 (2023) - 2022
- [j30]Pratik Misra, Seth Sullivant:
Directed Gaussian graphical models with toric vanishing ideals. Adv. Appl. Math. 138: 102345 (2022) - [j29]Benjamin Hollering, Seth Sullivant:
Exchangeable and sampling-consistent distributions on rooted binary trees. J. Appl. Probab. 59(1): 60-80 (2022) - [j28]Cashous Bortner, Seth Sullivant:
Structural identifiability of series-parallel LCR systems. J. Symb. Comput. 112: 79-104 (2022) - 2021
- [j27]Jane Ivy Coons, Seth Sullivant:
Toric geometry of the Cavender-Farris-Neyman model with a molecular clock. Adv. Appl. Math. 123: 102119 (2021) - [j26]Benjamin Hollering, Seth Sullivant:
Identifiability in phylogenetics using algebraic matroids. J. Symb. Comput. 104: 142-158 (2021) - [j25]Jane Ivy Coons, Seth Sullivant:
Quasi-independence models with rational maximum likelihood estimator. J. Symb. Comput. 104: 917-941 (2021) - [c3]Carlos Améndola, Benjamin Hollering, Seth Sullivant, Ngoc Tran:
Markov equivalence of max-linear Bayesian networks. UAI 2021: 1746-1755
2010 – 2019
- 2019
- [j24]Pratik Misra, Seth Sullivant:
Bounds on the Expected Size of the Maximum Agreement Subtree for a Given Tree Shape. SIAM J. Discret. Math. 33(4): 2316-2325 (2019) - 2017
- [j23]Daniel Irving Bernstein, Seth Sullivant:
Normal Binary Hierarchical Models. Exp. Math. 26(2): 153-164 (2017) - [j22]Elizabeth S. Allman, John A. Rhodes, Seth Sullivant:
Statistically Consistent k-mer Methods for Phylogenetic Tree Reconstruction. J. Comput. Biol. 24(2): 153-171 (2017) - [j21]Daniel Irving Bernstein, Seth Sullivant:
Unimodular binary hierarchical models. J. Comb. Theory B 123: 97-125 (2017) - 2016
- [j20]Johannes Rauh, Seth Sullivant:
Lifting Markov bases and higher codimension toric fiber products. J. Symb. Comput. 74: 276-307 (2016) - 2015
- [j19]Colby Long, Seth Sullivant:
Identifiability of 3-class Jukes-Cantor mixtures. Adv. Appl. Math. 64: 89-110 (2015) - [j18]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
- [j17]Nicolette Meshkat, Seth Sullivant:
Identifiable reparametrizations of linear compartment models. J. Symb. Comput. 63: 46-67 (2014) - [j16]Ruth Davidson, Seth Sullivant:
Distance-Based Phylogenetic MethodsAround a Polytomy. IEEE ACM Trans. Comput. Biol. Bioinform. 11(2): 325-335 (2014) - [i2]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
- [j15]Ruth Davidson, Seth Sullivant:
Polyhedral combinatorics of UPGMA cones. Adv. Appl. Math. 50(2): 327-338 (2013) - [j14]Jan Draisma, Seth Sullivant, Kelli Talaska:
Positivity for Gaussian graphical models. Adv. Appl. Math. 50(5): 661-674 (2013) - 2012
- [j13]Federico Ardila, Megan Owen, Seth Sullivant:
Geodesics in CAT(0) cubical complexes. Adv. Appl. Math. 48(1): 142-163 (2012) - [j12]Seth Sullivant:
The Disentangling Number for Phylogenetic Mixtures. SIAM J. Discret. Math. 26(2): 856-859 (2012) - [c2]Seth Sullivant:
Algebraic statistics. ISSAC 2012: 11 - 2011
- [j11]Hoda Bidkhori, Seth Sullivant:
Eulerian-Catalan Numbers. Electron. J. Comb. 18(1) (2011) - [j10]Elizabeth S. Allman, Sonja Petrovic, John A. Rhodes, Seth Sullivant:
Identifiability of Two-Tree Mixtures for Group-Based Models. IEEE ACM Trans. Comput. Biol. Bioinform. 8(3): 710-722 (2011) - [i1]Federico Ardila, Megan Owen, Seth Sullivant:
Geodesics in CAT(0) Cubical Complexes. CoRR abs/1101.2428 (2011) - 2010
- [c1]Luis Garcia, Sarah Spielvogel, Seth Sullivant:
Identifying Causal Effects with Computer Algebra. UAI 2010: 193-200
2000 – 2009
- 2008
- [j9]Seth Sullivant:
Algebraic geometry of Gaussian Bayesian networks. Adv. Appl. Math. 40(4): 482-513 (2008) - 2007
- [j8]Serkan Hosten, Seth Sullivant:
A finiteness theorem for Markov bases of hierarchical models. J. Comb. Theory A 114(2): 311-321 (2007) - 2006
- [j7]Aleksandra B. Slavkovic, Seth Sullivant:
The space of compatible full conditionals is a unimodular toric variety. J. Symb. Comput. 41(2): 196-209 (2006) - [j6]Nicholas Eriksson, Stephen E. Fienberg, Alessandro Rinaldo, Seth Sullivant:
Polyhedral conditions for the nonexistence of the MLE for hierarchical log-linear models. J. Symb. Comput. 41(2): 222-233 (2006) - 2005
- [j5]Bernd Sturmfels, Seth Sullivant:
Toric Ideals of Phylogenetic Invariants. J. Comput. Biol. 12(2): 204-228 (2005) - [j4]Bernd Sturmfels, Seth Sullivant:
Toric Ideals of Phylogenetic Invariants. J. Comput. Biol. 12(4): 457-481 (2005) - [j3]Seth Sullivant:
Small Contingency Tables with Large Gaps. SIAM J. Discret. Math. 18(4): 787-793 (2005) - 2004
- [j2]Adrian Dobra, Seth Sullivant:
A Divide-and-Conquer Algorithm for Generating Markov Bases of Multi-way Tables. Comput. Stat. 19(3): 347-366 (2004) - 2002
- [j1]Serkan Hosten, Seth Sullivant:
Gröbner Bases and Polyhedral Geometry of Reducible and Cyclic Models. J. Comb. Theory A 100(2): 277-301 (2002)
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 2025-01-20 22:57 CET 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:
