Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Stadnyk, Grace"'
Autor:
Bailey, Lora, Blake, Heather Smith, Cochran, Garner, Fox, Nathan, Levet, Michael, Mahmoud, Reem, Singgih, Inne, Stadnyk, Grace, Wiedemann, Alexander
Genome rearrangement is a common model for molecular evolution. In this paper, we consider the Pairwise Rearrangement problem, which takes as input two genomes and asks for the number of minimum-length sequences of permissible operations transforming
Externí odkaz:
http://arxiv.org/abs/2402.01942
Autor:
Bailey, Lora, Blake, Heather Smith, Cochran, Garner, Fox, Nathan, Levet, Michael, Mahmoud, Reem, Matson, Elizabeth, Singgih, Inne, Stadnyk, Grace, Wang, Xinyi, Wiedemann, Alexander
Publikováno v:
Theoretical Computer Science (2024)
In this paper, we examine the computational complexity of enumeration in certain genome rearrangement models. We first show that the Pairwise Rearrangement problem in the Single Cut-and-Join model (Bergeron, Medvedev, & Stoye, J. Comput. Biol. 2010)
Externí odkaz:
http://arxiv.org/abs/2305.01851
Autor:
Hersh, Patricia, Stadnyk, Grace
Publikováno v:
Combinatorial Theory 4 (1) (2024), 44 pages
Bj\"orner and Wachs introduced CL-shellability as a technique for studying the topological structure of order complexes of partially ordered sets (posets). They also introduced the notion of recursive atom ordering, and they proved that a finite boun
Externí odkaz:
http://arxiv.org/abs/2212.03949
Autor:
Stadnyk, Grace
The edge-product space of phylogenetic trees is a regular CW complex whose maximal closed cells correspond to trivalent trees with leaves labeled by a finite set $X$. The face poset of this cell decomposition is isomorphic to the Tuffley poset, a pos
Externí odkaz:
http://arxiv.org/abs/2112.09663
Autor:
Bailey, Lora, Blake, Heather Smith, Cochran, Garner, Fox, Nathan, Levet, Michael, Mahmoud, Reem, Matson, Elizabeth Bailey, Singgih, Inne, Stadnyk, Grace, Wang, Xinyi, Wiedemann, Alexander
Publikováno v:
In Theoretical Computer Science 29 December 2024 1022
Publikováno v:
Internat. J. Algebra Comput. 21 (2011), no. 6, 867-887
We introduce the $k$-peg Hanoi automorphisms and Hanoi self-similar groups, a generalization of the Hanoi Towers groups, and give conditions for them to be contractive. We analyze the limit spaces of a particular family of contracting Hanoi groups, $
Externí odkaz:
http://arxiv.org/abs/0909.3520
STEM Inclusive Teaching Practices Webinar Series: Socially Relevant Teaching in the Time of COVID-19
Autor:
Wares, Joanna, Torres, Marcella, Teymuroglu, Zeynep, Stadnyk, Grace, Hawthorne, Casey, Balreira, E
Presents various mathematical modeling and data science activities created around analyzing and interpreting COVID-19 data. Much of the instructional guidance provided for the activities and projects is easily adaptable to a remote learning environme
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5d3a191fb399de6b72508ce1843174c1
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.