Publisher
Springer International Publishing
Reference24 articles.
1. Brandes, U.: A faster algorithm for betweenness centrality*. J. Math. Sociol. 25(2), 163–177 (2001)
2. Dayarian, A., Michael, T.P., Sengupta, A.M.: SOPRA: scaffolding algorithm for paired reads via statistical optimization. BMC Bioinform. 11(1), 1 (2010)
3. Delcher, A.L., Salzberg, S.L., Phillippy, A.M.: Using MUMmer to identify similar regions in large sequence sets. Curr. Protocols Bioinform. 10.3.1–10.3.18 (2003). Chapter 10:Unit 10.3
4. Gao, S., Sung, W.-K., Nagarajan, N.: Opera: reconstructing optimal genomic scaffolds with high-throughput paired-end sequences. J. Comput. Biol. 18(11), 1681–1691 (2011)
5. Garey, M., Johnson, D.: Computers and Intractability - A Guide to NP-Completeness. W.H. Freeman & Co., New York (1979)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献