Combining overlap and containment for gene assembly in ciliates

DOI10.1016/j.tcs.2009.07.047zbMath1191.68358OpenAlexW2035047050MaRDI QIDQ847668

Hendrik Jan Hoogeboom, Robert Brijder

Publication date: 19 February 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.07.047

zbMATH Keywords

graph rewritingoverlap graphgene assembly in ciliatesDNA transformation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)

Related Items (1)

Simple gene assembly as a rewriting of directed overlap-inclusion graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Characterizing the micronuclear gene patterns in ciliates
• Sequential vs. Parallel complexity in simple gene assembly
• A short proof that `proper = unit'
• Circle graph obstructions
• Simultaneous representation of interval and interval-containment orders
• Computation in living cells. Gene assembly in ciliates
• Formal systems for gene assembly in ciliates.
• Reducibility of gene patterns in ciliates using the breakpoint graph.
• String and graph reduction systems for gene assembly in ciliates
• Representation of a finite graph by a set of intervals on the real line
• Extending the Overlap Graph for Gene Assembly in Ciliates
• A String-Based Model for Simple Gene Assembly
• A Characterization of Comparability Graphs and of Interval Graphs

This page was built for publication: Combining overlap and containment for gene assembly in ciliates