Reducibility of gene patterns in ciliates using the breakpoint graph.
From MaRDI portal
Publication:2490806
DOI10.1016/j.tcs.2006.01.041zbMath1160.68378MaRDI QIDQ2490806
Hendrik Jan Hoogeboom, Robert Brijder, Grzegorz Rozenberg
Publication date: 18 May 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.01.041
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
Related Items
Sorting permutations: Games, genomes, and cycles, Combining overlap and containment for gene assembly in ciliates, Sequential vs. Parallel complexity in simple gene assembly, The fibers and range of reduction graphs in ciliates, Strategies of loop recombination in ciliates, Graph theoretic approach to parallel gene assembly, Sorting by reversals and the theory of 4-regular graphs, Extending the Overlap Graph for Gene Assembly in Ciliates, REDUCTION GRAPHS FROM OVERLAP GRAPHS FOR GENE ASSEMBLY IN CILIATES
Cites Work