2017/06/22 by Joshua Cooper, Cooper, Joshua N., Hays Whitlatch +1 · 1 citation
Biochemistry, Genetics and Molecular Biology · #05C25 #05C30 #05C50 #05C75 #05C76 #05C85 #15A23 #15B33 #68R10 #92D20 #94C15 #Combinatorics (math.CO) #FOS: Mathematics #Fractal and DNA sequence analysis #Genome Rearrangement Algorithms #Machine Learning in Bioinformatics
paper · pdf · doi:10.48550/arxiv.1706.07468
openalex publication_date 2017/06/22 · openalex created_date 2022/10/04 · openalex updated_date 2026/07/28
We consider "pressing sequences", a certain kind of transformation of graphs\nwith loops into empty graphs, motivated by an application in phylogenetics. In\nparticular, we address the question of when a graph has precisely one such\npressing sequence, thus answering an question from Cooper and Davis (2015). We\ncharacterize uniquely pressable graphs, count the number of them on a given\nnumber of vertices, and provide a polynomial time recognition algorithm. We\nconclude with a few open questions.\n Keywords: Pressing sequence, adjacency matrix, Cholesky factorization, binary\nmatrix\n