Pages that link to "Item:Q974100"
From MaRDI portal
The following pages link to Computing the graph-based parallel complexity of gene assembly (Q974100):
Displaying 11 items.
- Graph reductions, binary rank, and pivots in gene assembly (Q411856) (← links)
- Graph multiset transformation: a new framework for massively parallel computation inspired by DNA computing (Q553930) (← links)
- Simple gene assembly as a rewriting of directed overlap-inclusion graphs (Q714803) (← links)
- Extended strings and graphs for simple gene assembly (Q846362) (← links)
- Parallel complexity of signed graphs for gene assembly in ciliates (Q931445) (← links)
- Graph theoretic approach to parallel gene assembly (Q1003730) (← links)
- The parallel complexity of signed graphs: Decidability results and an improved algorithm (Q1019708) (← links)
- Gene assembly through cyclic graph decomposition (Q1605478) (← links)
- Calculating Genomic Distances in Parallel Using OpenMP (Q5449962) (← links)
- DNA Computing (Q5494349) (← links)
- Combinatorial Pattern Matching (Q5713541) (← links)