Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Sequential vs. Parallel complexity in simple gene assembly

From MaRDI portal
Publication:924677
Jump to:navigation, search

DOI10.1016/j.tcs.2007.08.007zbMath1147.68522OpenAlexW1986665510MaRDI QIDQ924677

Ion Petre, Miika Langille

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

parallelismstringsciliatessimple gene assembly


Mathematics Subject Classification ID

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


Related Items (2)

Combining overlap and containment for gene assembly in ciliates ⋮ SUCCESSFUL ELEMENTARY GENE ASSEMBLY STRATEGIES



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Parallelism in 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.
  • Reducibility of gene patterns in ciliates using the breakpoint graph.
  • Transforming cabbage into turnip
  • A String-Based Model for Simple Gene Assembly


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:924677&oldid=12893992"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 18:34.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki