Pages that link to "Item:Q4547675"
From MaRDI portal
The following pages link to An Eulerian path approach to DNA fragment assembly (Q4547675):
Displayed 50 items.
- Towards a theory of patches (Q414472) (← links)
- Approximate all-pairs suffix/prefix overlaps (Q418172) (← links)
- On the complexity of the Eulerian closed walk with precedence path constraints problem (Q441867) (← links)
- The simplified partial digest problem: approximation and a graph-theoretic model (Q621677) (← links)
- Linear-time superbubble identification algorithm for genome assembly (Q897907) (← links)
- Consensus on de Bruijn graphs (Q978620) (← links)
- Graph algorithms for DNA sequencing -- origins, current models and the future (Q1681385) (← links)
- The principles of informational genomics (Q1682867) (← links)
- Construction of de Bruijn sequences from product of two irreducible polynomials (Q1696134) (← links)
- Modified classical graph algorithms for the DNA fragment assembly problem (Q1736710) (← links)
- Global optimization for scaffolding and completing genome assemblies (Q1742221) (← links)
- Alignment-free sequence comparison using absent words (Q1784946) (← links)
- On the complexity of approximately matching a string to a directed graph (Q2084771) (← links)
- Walk-preserving transformation of overlapped sequence graphs into blunt sequence graphs with GetBlunted (Q2117779) (← links)
- Space efficient merging of de Bruijn graphs and Wheeler graphs (Q2118200) (← links)
- All instantiations of the greedy algorithm for the shortest common superstring problem are equivalent (Q2146125) (← links)
- MetaCoAG: binning metagenomic contigs via composition, coverage and assembly graphs (Q2170126) (← links)
- Safety and completeness in flow decompositions for RNA assembly (Q2170145) (← links)
- Block structure and stability of the genetic code (Q2177184) (← links)
- Genetic code from tRNA point of view (Q2201978) (← links)
- The complexity of string partitioning (Q2343298) (← links)
- A fast algorithm for the construction of universal footprinting templates in DNA (Q2369299) (← links)
- Linking indexing data structures to de Bruijn graphs: construction and update (Q2424683) (← links)
- Four-regular graphs with rigid vertices associated to DNA recombination (Q2446317) (← links)
- Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree (Q2799166) (← links)
- Popping Superbubbles and Discovering Clumps: Recent Developments in Biological Sequence Analysis (Q2803803) (← links)
- Safe and Complete Contig Assembly Via Omnitigs (Q2814598) (← links)
- (Q2861508) (← links)
- Edge-Matching Problems with Rotations (Q3088275) (← links)
- AN EFFICIENT ALGORITHM FOR CHINESE POSTMAN WALK ON BI-DIRECTED DE BRUIJN GRAPHS (Q3166730) (← links)
- DNA-Seq Error Correction Based on Substring Indices (Q3305526) (← links)
- The Contig Assembly Problem and Its Algorithmic Solutions (Q3305536) (← links)
- Next generation sequencing under de novo genome assembly (Q3449133) (← links)
- On the Sound Covering Cycle Problem in Paired de Bruijn Graphs (Q3452560) (← links)
- On the Query Complexity of Testing Orientations for Being Eulerian (Q3541809) (← links)
- Scaling metagenome sequence assembly with probabilistic de Bruijn graphs (Q4907496) (← links)
- Approximating Shortest Superstring Problem Using de Bruijn Graphs (Q4928566) (← links)
- Failed zero forcing and critical sets on directed graphs (Q5026986) (← links)
- Synteny Paths for Assembly Graphs Comparison (Q5091750) (← links)
- Disentangled Long-Read De Bruijn Graphs via Optical Maps (Q5111789) (← links)
- An Eulerian path approach to local multiple alignment for DNA sequences (Q5293351) (← links)
- Bidirectional Variable-Order de Bruijn Graphs (Q5384620) (← links)
- Collapsing Superstring Conjecture (Q5875478) (← links)
- GTED: Graph Traversal Edit Distance (Q5881335) (← links)
- On the domination number of $t$-constrained de Bruijn graphs (Q6045459) (← links)
- VStrains: de novo reconstruction of viral strains via iterative path extraction from assembly graphs (Q6070700) (← links)
- Bounding the number of Eulerian tours in undirected graphs (Q6113863) (← links)
- An embedding technique in the study of word-representability of graphs (Q6153476) (← links)
- A one pass streaming algorithm for finding Euler tours (Q6174649) (← links)
- Refined bounds on the number of Eulerian tours in undirected graphs (Q6185942) (← links)