+++ /dev/null
-[[!meta title="Assembly of Long Error-Prone Reads Using Repeat Graphs"]]
-[[!tag genome assembly method]]
-
-Mikhail Kolmogorov, Jeffrey Yuan, Yu Lin, Pavel Pevzner
-
-bioRxiv, Posted January 12, 2018.
-
-Assembly of Long Error-Prone Reads Using Repeat Graphs
-
-[[!doi 10.1101/247148 desc="“Flye constructs (overlapping) contigs with possible assembly errors at the initial stage, combines them into an accurate assembly graph, resolves repeats in the assembly graph using small variations between various repeat instances that were left unresolved during the initial assembly stage, constructs a new, less tangled assembly graph based on resolved repeats, and finally outputs accurate contigs as paths in this graph.”"]]
--- /dev/null
+[[!meta title="Assembly of Long Error-Prone Reads Using Repeat Graphs"]]
+[[!tag genome assembly method]]
+
+Mikhail Kolmogorov, Jeffrey Yuan, Yu Lin, Pavel Pevzner
+
+Nat Biotechnol. 2019 May;37(5):540-546. doi:10.1038/s41587-019-0072-8
+
+Assembly of Long Error-Prone Reads Using Repeat Graphs
+
+[[!pmid 30936562 desc="“Flye constructs (overlapping) contigs with possible assembly errors at the initial stage, combines them into an accurate assembly graph, resolves repeats in the assembly graph using small variations between various repeat instances that were left unresolved during the initial assembly stage, constructs a new, less tangled assembly graph based on resolved repeats, and finally outputs accurate contigs as paths in this graph.”"]]
read length is satisfactory.
The Flye assembler ([[Kolmogorov and coll, bioRxiv
-2018|biblio/10.1101_247148]]) creates an A-Bruijn (assembly) graph from draft
+2018|biblio/30936562]]) creates an A-Bruijn (assembly) graph from draft
contigs using long error-prone reads, untangles the graph by resolving repeats,
and then uses it to refine the contings and increase their accuracy. (The
predecessor of Flye, ABruijn, was reported by [[Istace and coll.