Linear-time superbubble identification algorithm for genome assembly (Q897907): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An Eulerian path approach to DNA fragment assembly / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5834367 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2747613 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Edge-disjoint spanning trees and depth-first search / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A simple linear-space data structure for constant-time range minimum query / rank | |||
Normal rank | |||
Latest revision as of 03:46, 11 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear-time superbubble identification algorithm for genome assembly |
scientific article |
Statements
Linear-time superbubble identification algorithm for genome assembly (English)
0 references
8 December 2015
0 references
genome assembly
0 references
de Bruijn graphs
0 references
superbubble
0 references
0 references
