Improved gap size estimation for scaffolding algorithms

Bioinformatics

Volumn 28, Issue 17, 2012, Pages 2215-2222

  Sahlin, Kristoffer ^a   Street, Nathaniel ^b   Lundeberg, Joakim ^a   Arvestad, Lars ^a,c  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b Umea Plant Science Center   (Sweden)

^c STOCKHOLM UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; COMPUTER PROGRAM; CONTIG MAPPING; DNA SEQUENCE; GENE LIBRARY; GENOMICS; METHODOLOGY; PROBABILITY; REGRESSION ANALYSIS; STATISTICAL MODEL;

ALGORITHMS; CONTIG MAPPING; GENE LIBRARY; GENOMICS; LIKELIHOOD FUNCTIONS; MODELS, GENETIC; PROBABILITY; REGRESSION ANALYSIS; SEQUENCE ANALYSIS, DNA; SOFTWARE;

EID: 84865546399     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/bts441     Document Type: Article

References (18)

1. Boetzer, M. et al. (2010) Scaffolding pre-assembled contigs using SSPACE. Bioinformatics, 4, 578-579.
2. Dayarian, A. et al. (2010) SOPRA: Scaffolding algorithm for paired reads via statistical optimization. BMC Bioinformatics, 11, 345.
3. Gao, S. et al. (2011) Opera: reconstructing optimal genomic scaffolds with high-throughput paired-end sequences. J. Comput. Biol., 11, 1681-1691.
4. Huson, D.H. et al. (2002) The greedy path-merging algorithm for contig scaffolding. J. ACM, 49, 603-615.
5. Kurtz, S. et al. (2004) Versatile and open software for comparing large genomes. Genome Biol., 5, R12.
6. Langmead, B. et al. (2009) Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biol., 10, R25.
7. Le Cam, L. (1990) Maximum likelihood: an introduction. Int. Stat. Rev., 58, 153-171.
8. Li, H. and Durbin, R. (2009) Fast and accurate short read alignment with Burrows-Wheeler Transform. Bioinformatics, 25, 1754-1760.
9. Lysholm, F. et al. (2011) An efficient simulator of 454 data using configurable statistical models. BMC Res. Notes 2011, 4, 449.
10. Mardis, E.R. et al. (2008) The impact of next-generation sequencing technology on genetics. Trends Gene., 24, 133-141.
11. Nagarajan, N et al. (2010) Finishing genomes with limited resources: lessons from an ensemble of microbial genomes. BMC Genom., 11, 242.
12. Phillippy, A.M. et al. (2008) Genome assembly forensics: finding the elusive mis-assembly. Genome Biol., 9, R55.
13. Pop, M. et al. (2011) Hierarchical scaffolding with Bambus. Genome Res., 14, 149-159.
14. Pop, M. and Salzberg, S.L. (2008) Bioinformatics challenges of new sequencing technology. Trends Genet., 24, 133-141.
15. Pop, M. (2009) Genome assembly reborn: recent computational challenges. Brief. Bioinform., 10, 354-366.
16. Richter, D.C. et al. (2008) MetaSim-A sequencing simulator for genomics and metagenomics. PLoS One, 3, e3373.
17. Salmela, L. et al. (2011) Fast scaffolding with small independent mixed integer programs. Bioinformatics, 23, 3259-3265.
18. Salzberg, S.L. et al. (2012) GAGE: a critical evaluation of genome assemblies and assembly algorithms. Genome Res., 22, 557-567.