Reductions on Double Occurrence Words
Combinatorics
2013-11-15 v1
Abstract
In the present paper we consider biologically motivated reduction operations on double occurrence words. Then we define the nesting index of a double occurrence word to be the least number of reduction operations it takes for a word to be reduced to the empty word. We use chord diagrams and circle graphs as tools to study the nesting index of double occurrence words.
Cite
@article{arxiv.1311.3543,
title = {Reductions on Double Occurrence Words},
author = {Ryan Arredondo},
journal= {arXiv preprint arXiv:1311.3543},
year = {2013}
}
Comments
Submitted to the proceedings of the Fourty-fourth Southeastern International Conference on Combinatorics, Graph Theory, and Computing