Skip to main content

ScaffMatch: Scaffolding Algorithm Based on Maximum Weight Matching

  • Conference paper
  • First Online:

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

Abstract

Next-generation sequencing (NGS) is a powerful technology as it can produce millions of short read pairs covering whole genome; however, a complete genome assembly remains challenging. Usually, assembled genome pieces (i.e., contigs) are merged into chains (i.e., scaffolds) using read pairs mapped to pairs of contigs. A recent comprehensive evaluation of available software shows that the scaffolding problem is still open [1]. In this paper we present a novel scaffolding tool ScaffMatch based on the maximum weight matching of pairs of reverse complement strands representing contigs and further filling the scaffold with skipped short contigs.

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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

References

  1. Hunt, M., Newbold, C., Berriman, M., Otto, T.D.: A comprehensive evaluation of assembly scaffolding tools. Genome Biology 15(3), 42 (2014)

    Article  Google Scholar 

  2. Gao, S., Sung, W.-K., Nagarajan, N.: Opera: Reconstructing optimal genomic scaffolds with high-throughput paired-end sequences. Journal of Computational Biology 18(11), 1681–1691 (2011)

    Article  MathSciNet  Google Scholar 

  3. Donmez, N., Brudno, M.: Scarpa: scaffolding reads with practical algorithms. Bioinformatics 29(4), 428–434 (2013)

    Article  Google Scholar 

  4. Lindsay, J., Salooti, H., Mandoiu, I.I., Zelikovsky, A.: Ilp-based maximum likelihood genome scaffolding. BMC Bioinformatics 15(Suppl 9), S9 (2014)

    Article  Google Scholar 

  5. Salmela, L., Mäkinen, V., Välimäki, N., Ylinen, J., Ukkonen, E.: Fast scaffolding with small independent mixed integer programs. Bioinformatics (Oxford, England) 27(23), 3259–3265 (2011). doi:10.1093/bioinformatics/btr562

    Article  Google Scholar 

  6. Dayarian, A., Michael, T.P., Sengupta, A.M.: Sopra: Scaffolding algorithm for paired reads via statistical optimization. BMC Bioinformatics 11(1), 345 (2010)

    Article  Google Scholar 

  7. Boetzer, M., Henkel, C.V., Jansen, H.J., Butler, D., Pirovano, W.: Scaffolding pre-assembled contigs using sspace. Bioinformatics 27(4), 578–579 (2011)

    Article  Google Scholar 

  8. Sahlin, K., Vezzi, F., Nystedt, B., Lundeberg, J., Arvestad, L.: Besst-efficient scaffolding of large fragmented assemblies. BMC Bioinformatics 15(1), 281 (2014)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Igor Mandric .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Mandric, I., Zelikovsky, A. (2015). ScaffMatch: Scaffolding Algorithm Based on Maximum Weight Matching. In: Przytycka, T. (eds) Research in Computational Molecular Biology. RECOMB 2015. Lecture Notes in Computer Science(), vol 9029. Springer, Cham. https://doi.org/10.1007/978-3-319-16706-0_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-16706-0_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-16705-3

  • Online ISBN: 978-3-319-16706-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics