Reductions on Double Occurrence Words

MaRDI QIDQ5405503zbMATH OpenFDO

Authors Ryan Arredondo

Publication date 2 April 2014

Full work available at URL https://arxiv.org/abs/1311.3543

zbMATH Keywords

chord diagramcircle graphGauss codesciliate biology

Mathematics Subject Classification ID

Applications of graph theory (05C90) Genetics and epigenetics (92D10)

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.

Recommendations

• Counting irreducible double occurrence words
• On the realization of double occurrence words
• Insertions yielding equivalent double occurrence words
• Double occurrence words: their graphs and matrices
• Reduced word manipulation: patterns and enumeration
• On the prefix-suffix duplication reduction
• scientific article; zbMATH DE number 554160
• Sorting and generating reduced words
• Reduced word enumeration, complexity, and randomization
• Symbol Separation in Double Occurrence Words

Cited in

(7)

• Text redundancies
• scientific article; zbMATH DE number 554160 (Why is no real title available?)
• Double occurrence words: their graphs and matrices
• Patterns and distances in words related to DNA rearrangement
• Recurring patterns among scrambled genes in the encrypted genome of the ciliate \textit{Oxytricha trifallax}
• Symbol Separation in Double Occurrence Words
• Counting irreducible double occurrence words

This page was built for publication: Reductions on Double Occurrence Words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405503)