3 citations · 4 across the 2 of their papers we have counts for
2 papers
q-bio.GN2023★ 1 cited
Complexity and Enumeration in Models of Genome Rearrangement
Lora Bailey, Heather Smith Blake, Garner Cochran +8
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 Cu…
math.CO2022★ 3 cited
Boolean dimension and dim-boundedness: Planar cover graph with a zero
Heather Smith Blake, Piotr Micek, William T. Trotter
In 1989, Nešetřil and Pudlák posed the following challenging question: Do planar posets have bounded Boolean dimension? We show that every poset with a planar cover graph and a uni…