Successful Pressing Sequences for a Bicolored Graph and Binary Matrices
Combinatorics
2015-09-29 v5
Abstract
We apply matrix theory over to understand the nature of so-called "successful pressing sequences" of black-and-white vertex-colored graphs. These sequences arise in computational phylogenetics, where, by a celebrated result of Hannenhalli and Pevzner, the space of sortings-by-reversal of a signed permutation can be described by pressing sequences. In particular, we offer several alternative linear-algebraic and graph-theoretic characterizations of successful pressing sequences, describe the relation between such sequences, and provide bounds on the number of them. We also offer several open problems that arose as a result of the present work.
Cite
@article{arxiv.1502.07450,
title = {Successful Pressing Sequences for a Bicolored Graph and Binary Matrices},
author = {Joshua Cooper and Jeffrey Davis},
journal= {arXiv preprint arXiv:1502.07450},
year = {2015}
}