Symbol Separation in Double Occurrence Words
From MaRDI portal
Publication:5859654
DOI10.1142/S0129054120500343zbMath1458.68151OpenAlexW3099291835MaRDI QIDQ5859654
Masahico Saito, Hwee Kim, Brad Mostowski, Nataša Jonoska
Publication date: 19 April 2021
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054120500343
Cites Work
- Recurring patterns among scrambled genes in the encrypted genome of the ciliate \textit{Oxytricha trifallax}
- Homotopy invariants of Gauss words
- Circle graphs and monadic second-order logic
- DNA recombination through assembly graphs
- On the realization of double occurrence words
- On a class of linked diagrams. I: Enumeration
- Non-P-recursiveness of numbers of matchings or linear chord diagrams with many crossings
- Computation in living cells. Gene assembly in ciliates
- Virtual strings.
- Four-regular graphs with rigid vertices associated to DNA recombination
- Counting Irreducible Double Occurrence Words
- Patterns and Distances in Words Related to DNA Rearrangement
- A self-linking invariant of virtual knots
- Insertions Yielding Equivalent Double Occurrence Words
This page was built for publication: Symbol Separation in Double Occurrence Words
