.png){kind=icon}
.png){kind=icon}
Return
An O(m log m)-Time Algorithm for Detecting Superbubbles
.png){kind=icon}
PRE
AI
DOI：10.1109/TCBB.2014.2385696.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In genome assembly graphs, motifs such as tips, bubbles, and cross links are studied in order to find sequencing errors and to understand the nature of the genome. Superbubble, a complex generalization of bubbles, was recently proposed as an important subgraph class for analyzing assembly graphs. At present, a quadratic time algorithm is known. This paper gives an O(m log m)-time algorithm to solve this problem for a graph with m edges.
Keywords:
Superbubble
genome assembly
next generation sequencing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
3.4
Papers:
3.3K
Citations:
6.4K
Organization
View more organizations