2016 27th International Workshop on Database and Expert Systems Applications (DEXA) 2016
DOI: 10.1109/dexa.2016.032
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Hybrid De Novo Error Correction and Assembly for Long Reads

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 39 publications
0
3
0
Order By: Relevance
“…We have selected what we believe is a representative set of tools but there also exist other tools that were not considered in this study, e.g. HG-Color [39], HECIL [40], MIRCA [41], Jabba [42], nanocorr [43], and Racon [44].…”
Section: Introductionmentioning
confidence: 99%
“…We have selected what we believe is a representative set of tools but there also exist other tools that were not considered in this study, e.g. HG-Color [39], HECIL [40], MIRCA [41], Jabba [42], nanocorr [43], and Racon [44].…”
Section: Introductionmentioning
confidence: 99%
“…This type of methods have no special requirements for third-party alignment tools, but they are difficult to align short reads to repetitive and noisy regions of the long read due to their small length. To overcome this obstacle, short-read assembly-based methods, such as ECTools 13 , HALC 14 , and MiRCA 15 , assemble short reads into longer contigs in advance. In this way, the assembled contigs can be effectively aligned to repetitive and noisy regions in long reads.…”
Section: Related Workmentioning
confidence: 99%
“…HALC [9], MiRCA [10] are based on this strategy, the context information of adjacent regions after assembly can make the contigs align to repetitive and noisy regions in long reads effectively. The DBG-based methods directly use the DBG constructed by short-read k-mers to avoid the complex assembly process, and then anchor the long read to the DBG and traverse the graph to obtain an optimal path.…”
Section: Introductionmentioning
confidence: 99%