Skip to main content

Genome Assembler for Repetitive Sequences

  • Conference paper
  • 2327 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 7339))

Abstract

The article presents a new algorithm for random DNA fragment assembly. The algorithm uses an extended de Bruijn graph that stores information of reads coverage. It is able to reconstruct consecutive repetitive sequences longer than reads and to process large amount of data provided by new generation sequencers. Preliminary simulation results show the advantages of the method.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Shendure, J., Ji, H.: Next-generation dna sequencing. Nature Biotechnology 26(10), 1135–1145 (2008)

    Article  PubMed  CAS  Google Scholar 

  2. Sanger, F., Nicklen, S., Coulson, A.: Dna sequencing with chain-terminating inhibitors. Proceedings of the National Academy of Sciences 74(12), 5463 (1977)

    Article  CAS  Google Scholar 

  3. Lander, E., Waterman, M.: Genomic mapping by fingerprinting random clones: a mathematical analysis. Genomics 2(3), 231–239 (1988)

    Article  PubMed  CAS  Google Scholar 

  4. Zhang, W., Chen, J., Yang, Y., Tang, Y., Shang, J., Shen, B.: A practical comparison of de novo genome assembly software tools for next-generation sequencing technologies. PloS One 6(3), e17915 (2011)

    Google Scholar 

  5. Pevzner, P., Tang, H., Waterman, M.: An eulerian path approach to dna fragment assembly. Proceedings of the National Academy of Sciences 98(17), 9748 (2001)

    Article  CAS  Google Scholar 

  6. Myers, E.: Toward simplifying and accurately formulating fragment assembly. Journal of Computational Biology 2(2), 275–290 (1995)

    Article  PubMed  CAS  Google Scholar 

  7. Myers, E.: The fragment assembly string graph. Bioinformatics 21(suppl. 2), ii79–ii85 (2005)

    Google Scholar 

  8. Pevzner, P., Tang, H., Tesler, G.: De novo repeat classification and fragment assembly. Genome Research 14(9), 1786–1796 (2004)

    Article  PubMed  CAS  Google Scholar 

  9. Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to algorithms. The MIT press (2001)

    Google Scholar 

  10. libraries, B.: http://www.boost.org

  11. Hochhut, B., Wilde, C., Balling, G., Middendorf, B., Dobrindt, U., Brzuszkiewicz, E., Gottschalk, G., Carniel, E., Hacker, J.: Role of pathogenicity island-associated integrases in the genome plasticity of uropathogenic escherichia coli strain 536. Molecular Microbiology 61(3), 584–595 (2006)

    Article  PubMed  CAS  Google Scholar 

  12. Goffeau, A., Barrell, B., Bussey, H., Davis, R., Dujon, B., Feldmann, H., Galibert, F., Hoheisel, J., Jacq, C., Johnston, M., et al.: Life with 6000 genes. Science 274(5287), 546 (1996)

    Article  PubMed  CAS  Google Scholar 

  13. Paszkiewicz, K., Studholme, D.: De novo assembly of short sequence reads. Briefings in Bioinformatics 11(5), 457 (2010)

    Article  PubMed  CAS  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nowak, R.M. (2012). Genome Assembler for Repetitive Sequences. In: Piętka, E., Kawa, J. (eds) Information Technologies in Biomedicine. Lecture Notes in Computer Science(), vol 7339. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31196-3_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31196-3_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31195-6

  • Online ISBN: 978-3-642-31196-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics