Primer | Published:

How to apply de Bruijn graphs to genome assembly

Nature Biotechnology volume 29, pages 987991 (2011) | Download Citation

A mathematical concept known as a de Bruijn graph turns the formidable challenge of assembling a contiguous genome from billions of short sequencing reads into a tractable computational problem.

Access optionsAccess options

Rent or Buy article

Get time limited or full article access on ReadCube.

from$8.99

All prices are NET prices.

References

  1. 1.

    Commentarii Academiae Scientiarum Petropolitanae 8, 128–140 (1741).

  2. 2.

    The Algorithm Design Manual (Springer, Berlin, 2008).

  3. 3.

    et al. Nature 409, 860–921 (2001).

  4. 4.

    et al. Science 291, 1304–1351 (2001).

  5. 5.

    & Algorithmica 13, 7–51 (1995).

  6. 6.

    et al. Science 287, 2185–2195 (2000).

  7. 7.

    et al. Science 269, 496–512 (1995).

  8. 8.

    , & Genome Res. 20, 1165–1173 (2010).

  9. 9.

    , , , & Nat. Biotechnol. 26, 1336–1338 (2008).

  10. 10.

    & Bioinformatics 26, 2509–2516 (2010).

  11. 11.

    et al. Nat. Biotechnol. 29, 644–652 (2011).

  12. 12.

    Proc. Nederl. Akad. Wetensch. 49, 758–764 (1946).

  13. 13.

    & J. Comput. Biol. 2, 291–306 (1995).

  14. 14.

    , & Proc. Natl. Acad. Sci. USA 98, 9748–9753 (2001).

  15. 15.

    , & Genome Res. 14, 1786–1796 (2004).

  16. 16.

    & Genome Res. 18, 324–330 (2008).

  17. 17.

    & Genome Res. 18, 821–829 (2008).

  18. 18.

    et al. Genome Res. 18, 810–820 (2008).

  19. 19.

    et al. Genome Res. 19, 1117–1123 (2009).

  20. 20.

    et al. Genome Res. 20, 265–272 (2010).

  21. 21.

    & Brief. Bioinform. 11, 457–472 (2010).

  22. 22.

    , & Genomics 95, 315–327 (2010).

  23. 23.

    , , & Genomics 4, 114–128 (1989).

  24. 24.

    United Kingdom patent application gb8810400 (1988).

  25. 25.

    et al. Doklady Academy Nauk USSR 303, 1508–1511 (1988).

  26. 26.

    J. Biomol. Struct. Dyn. 7, 63–73 (1989).

Download references

Acknowledgements

This work was supported by grants from Howard Hughes Medical Institute (HHMI grant 52005726), the US National Institutes of Health (NIH grant 3P41RR024851-02S1) and the National Science Foundation (NSF grant DMS-0718810). We are grateful to S. Wasserman for many helpful comments.

Author information

Affiliations

  1. Phillip E. C. Compeau and Glenn Tesler are in the Department of Mathematics, University of California San Diego, La Jolla, California, USA

    • Phillip E C Compeau
    •  & Glenn Tesler
  2. Pavel A. Pevzner is in the Department of Computer Science and Engineering, University of California San Diego, La Jolla, California, USA.

    • Pavel A Pevzner

Authors

  1. Search for Phillip E C Compeau in:

  2. Search for Pavel A Pevzner in:

  3. Search for Glenn Tesler in:

Competing interests

The authors declare no competing financial interests.

Corresponding author

Correspondence to Pavel A Pevzner.

Supplementary information

PDF files

  1. 1.

    Supplementary Figure 1 and 2

    De Bruijn graph from reads with sequencing errors

About this article

Publication history

Published

DOI

https://doi.org/10.1038/nbt.2023

Further reading