Crossmark

Assembly of long, error-prone reads using repeat graphs

Crossref DOI link: https://doi.org/10.1038/s41587-019-0072-8

Published Online: 2019-04-01

Published Print: 2019-05

Update policy: https://doi.org/10.1007/springer_crossmark_policy

Authors

Kolmogorov, Mikhail http://orcid.org/0000-0002-5489-9045
Yuan, Jeffrey http://orcid.org/0000-0003-3855-1994
Lin, Yu http://orcid.org/0000-0001-6339-2644
Pevzner, Pavel A. http://orcid.org/0000-0002-0418-165X
License Information

Text and Data Mining valid from 2019-04-01
More Information

Article History

Received: 14 May 2018

Accepted: 6 February 2019

First Online: 1 April 2019

Competing interests

: The authors declare no competing interests.