Extended strings and graphs for simple gene assembly
From MaRDI portal
Recommendations
- A String-Based Model for Simple Gene Assembly
- Simple gene assembly as a rewriting of directed overlap-inclusion graphs
- Superstring graph: a new approach for genome assembly
- Gene assembly through cyclic graph decomposition
- String and graph reduction systems for gene assembly in ciliates
- Graph theoretic approach to parallel gene assembly
- Computing the graph-based parallel complexity of gene assembly
- Simple Operations for Gene Assembly
- Graph reductions, binary rank, and pivots in gene assembly
Cites work
Cited in
(16)- Sequential vs. Parallel complexity in simple gene assembly
- A String-Based Model for Simple Gene Assembly
- Parallel complexity of signed graphs for gene assembly in ciliates
- Computing the graph-based parallel complexity of gene assembly
- The parallel complexity of signed graphs: Decidability results and an improved algorithm
- Simple gene assembly as a rewriting of directed overlap-inclusion graphs
- Combining overlap and containment for gene assembly in ciliates
- Aspects of Molecular Computing
- Directed overlap-inclusion graphs as representations of ciliate genes
- Combinatorial Pattern Matching
- scientific article; zbMATH DE number 6400876 (Why is no real title available?)
- Characterizing Reduction Graphs for Gene Assembly in Ciliates
- From Micro to Macro: How the Overlap Graph Determines the Reduction Graph in Ciliates
- Simple Operations for Gene Assembly
- Gene assembly through cyclic graph decomposition
- New Computational Paradigms
This page was built for publication: Extended strings and graphs for simple gene assembly
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q846362)