Sequential vs. Parallel complexity in simple gene assembly

DOI10.1016/J.TCS.2007.08.007MaRDI QIDQ924677zbMATH OpenOpenAlexFDO

Authors Miika Langille, Ion Petre

Publication date 19 May 2008

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

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

zbMATH Keywords

ciliatesparallelismsimple gene assemblystrings

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• A String-Based Model for Simple Gene Assembly
• Extended strings and graphs for simple gene assembly
• Simple gene assembly is deterministic
• Simple Operations for Gene Assembly
• Parallel complexity of signed graphs for gene assembly in ciliates

Cites work

• A String-Based Model for Simple Gene Assembly
• A very elementary presentation of the Hannenhalli-Pevzner theory
• Computation in living cells. Gene assembly in ciliates
• Formal systems for gene assembly in ciliates.
• scientific article; zbMATH DE number 1408359 (Why is no real title available?)
• Parallelism in gene assembly
• Reducibility of gene patterns in ciliates using the breakpoint graph.
• Simple gene assembly is deterministic
• Transforming cabbage into turnip

Cited in

(10)

• Graph theoretic approach to parallel gene assembly
• The parallel complexity of signed graphs: Decidability results and an improved algorithm
• Simple Operations for Gene Assembly
• SUCCESSFUL ELEMENTARY GENE ASSEMBLY STRATEGIES
• A String-Based Model for Simple Gene Assembly
• DNA Computing
• Combinatorial Pattern Matching
• Combining overlap and containment for gene assembly in ciliates
• Parallel complexity of signed graphs for gene assembly in ciliates
• Computing the graph-based parallel complexity of gene assembly

This page was built for publication: Sequential vs. Parallel complexity in simple gene assembly

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