메뉴 건너뛰기




Volumn 6577 LNBI, Issue , 2011, Pages 437-451

Opera: Reconstructing Optimal Genomic Scaffolds with High-Throughput Paired-End Sequences

Author keywords

[No Author keywords available]

Indexed keywords

GENES; MOLECULAR BIOLOGY; QUADRATIC PROGRAMMING;

EID: 79953216356     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20036-6_40     Document Type: Conference Paper
Times cited : (14)

References (24)
  • 1
    • 33746207763 scopus 로고    scopus 로고
    • Multiplex sequencing of paired-end ditags (MS-PET): A strategy for the ultra-high-throughput analysis of transcriptomes and genomes
    • Ng, P., Tan, J.J., Ooi, H.S., et al.: Multiplex sequencing of paired-end ditags (MS-PET): A strategy for the ultra-high-throughput analysis of transcriptomes and genomes. Nucleic Acids Research 34, e84 (2006)
    • (2006) Nucleic Acids Research , vol.34
    • Ng, P.1    Tan, J.J.2    Ooi, H.S.3
  • 2
    • 58149234737 scopus 로고    scopus 로고
    • Real-time DNA sequencing from single polymerase molecules
    • Eid, J., Fehr, A., Gray, J., et al.: Real-time DNA sequencing from single polymerase molecules. Science 323(5910), 133–138 (2009)
    • (2009) Science , vol.323 , Issue.5910 , pp. 133-138
    • Eid, J.1    Fehr, A.2    Gray, J.3
  • 3
    • 77954324418 scopus 로고    scopus 로고
    • SOPRA: Scaffolding algorithm for paired reads via statistical optimization
    • Dayarian, A., Michael, T.P., Sengupta, A.M.: SOPRA: Scaffolding algorithm for paired reads via statistical optimization. BMC Bioinformatics 11(345) (2010)
    • (2010) BMC Bioinformatics , vol.11 , pp. 345
    • Dayarian, A.1    Michael, T.P.2    Sengupta, A.M.3
  • 4
    • 59949093527 scopus 로고    scopus 로고
    • De novo fragment assembly with short mate-paired reads: Does the read length matter?
    • Chaisson, M.J., Brinza, D., Pevzner, P.A.: De novo fragment assembly with short mate-paired reads: does the read length matter? Genome Research 19, 336–346 (2009)
    • (2009) Genome Research , vol.19 , pp. 336-346
    • Chaisson, M.J.1    Brinza, D.2    Pevzner, P.A.3
  • 5
    • 77949511368 scopus 로고    scopus 로고
    • Pebble and rock band: Heuristic resolution of repeats and scaffolding in the velvet short-read de novo assembler
    • Zerbino, D.R., McEwen, G.K., Marguiles, E.H., Birney, E.: Pebble and rock band: heuristic resolution of repeats and scaffolding in the velvet short-read de novo assembler. PLoS ONE 4(12) (2009)
    • (2009) Plos ONE , vol.4 , Issue.12
    • Zerbino, D.R.1    McEwen, G.K.2    Marguiles, E.H.3    Birney, E.4
  • 6
    • 1242281253 scopus 로고    scopus 로고
    • The greedy path-merging algorithm for contig scaffolding
    • Huson, D.H., Reinert, K., Myers, E.W.: The greedy path-merging algorithm for contig scaffolding. Journal of the ACM 49(5), 603–615 (2002)
    • (2002) Journal of the ACM , vol.49 , Issue.5 , pp. 603-615
    • Huson, D.H.1    Reinert, K.2    Myers, E.W.3
  • 7
    • 0034708758 scopus 로고    scopus 로고
    • A whole-genome assembly of Drosophila
    • Myers, E.W., Sutton, G.G., Delcher, A.L., et al.: A whole-genome assembly of Drosophila. Science 287(5461), 2196–2204 (2000)
    • (2000) Science , vol.287 , Issue.5461 , pp. 2196-2204
    • Myers, E.W.1    Sutton, G.G.2    Delcher, A.L.3
  • 8
    • 0034837599 scopus 로고    scopus 로고
    • Assembly of the working draft of the human genome with GigAssembler
    • Kent, W.J., Haussler, D.: Assembly of the working draft of the human genome with GigAssembler. Genome Research 11, 1541–1548 (2001)
    • (2001) Genome Research , vol.11 , pp. 1541-1548
    • Kent, W.J.1    Haussler, D.2
  • 9
    • 0035232164 scopus 로고    scopus 로고
    • Fragment assembly with double-barreled data
    • Pevzner, P.A., Tang, H.: Fragment assembly with double-barreled data. Bioinformatics 17(S1), 225–233 (2001)
    • (2001) Bioinformatics , vol.17 , pp. 225-233
    • Pevzner, P.A.1    Tang, H.2
  • 10
  • 12
    • 0037267048 scopus 로고    scopus 로고
    • Whole-genome sequence assembly for mammalian genomes: Arachne 2
    • Jaffe, D.B., Butler, J., Gnerre, S., et al.: Whole-genome sequence assembly for mammalian genomes: Arachne 2. Genome Research 13, 91–96 (2003)
    • (2003) Genome Research , vol.13 , pp. 91-96
    • Jaffe, D.B.1    Butler, J.2    Gnerre, S.3
  • 13
    • 0037162885 scopus 로고    scopus 로고
    • Whole-genome shotgun assembly and analysis of the genome of Fugu rubripes
    • Aparicio, S., Chapma, J., Stupka, E., et al.: Whole-genome shotgun assembly and analysis of the genome of Fugu rubripes. Science 297, 1301–1310 (2002)
    • (2002) Science , vol.297 , pp. 1301-1310
    • Aparicio, S.1    Chapma, J.2    Stupka, E.3
  • 15
    • 34547852218 scopus 로고    scopus 로고
    • OSLay: Optimal syntenic layout of unfinished assemblies
    • Richter, D.C., Schuster, S.C., Huson, D.H.: OSLay: optimal syntenic layout of unfinished assemblies. Bioinformatics 23(13), 1573–1579 (2007)
    • (2007) Bioinformatics , vol.23 , Issue.13 , pp. 1573-1579
    • Richter, D.C.1    Schuster, S.C.2    Huson, D.H.3
  • 17
    • 43349084767 scopus 로고    scopus 로고
    • Scaffolding and validation of bacterial genome assemblies using optical restriction maps
    • Nagarajan, N., Read, T.D., Pop, M.: Scaffolding and validation of bacterial genome assemblies using optical restriction maps. Bioinformatics 24(10), 1229–1235 (2008)
    • (2008) Bioinformatics , vol.24 , Issue.10 , pp. 1229-1235
    • Nagarajan, N.1    Read, T.D.2    Pop, M.3
  • 18
    • 34547312505 scopus 로고    scopus 로고
    • Shotgun sequence assembly
    • Pop, M.: Shotgun sequence assembly. Advances in Computers 60 (2004)
    • (2004) Advances in Computers , vol.60
    • Pop, M.1
  • 19
    • 0038490433 scopus 로고
    • Dynamic programming algorithms for recognizing small-bandwidth graphs in polynomial time
    • Saxe, J.: Dynamic programming algorithms for recognizing small-bandwidth graphs in polynomial time. SIAM J. on Algebraic and Discrete Methodd 1(4), 363–369 (1980)
    • (1980) SIAM J. on Algebraic and Discrete Methodd , vol.1 , Issue.4 , pp. 363-369
    • Saxe, J.1
  • 20
    • 0020826623 scopus 로고
    • A numerically stable dual method for solving strictly convex quadratic programs
    • Goldfarb, D., Idnani, A.: A numerically stable dual method for solving strictly convex quadratic programs. Mathematical Programming 27 (1983)
    • (1983) Mathematical Programming , vol.27
    • Goldfarb, D.1    Idnani, A.2
  • 21
    • 54949137701 scopus 로고    scopus 로고
    • Metasim: A sequencing simulator for genomics and metagenomics
    • Richter, D.C., Ott, F., Schmid, R., Huson, D.H.: Metasim: a sequencing simulator for genomics and metagenomics. PloS One 3(10) (2008)
    • (2008) Plos One , vol.3 , Issue.10
    • Richter, D.C.1    Ott, F.2    Schmid, R.3    Huson, D.H.4
  • 22
    • 75349109607 scopus 로고    scopus 로고
    • ALLPATHS2: Small genomes assembled accurately and with high continuity from short paired reads
    • MacCallum, I., Przybylksi, D., Gnerre, S., et al.: ALLPATHS2: small genomes assembled accurately and with high continuity from short paired reads. Genome Biology 10, R103 (2009)
    • (2009) Genome Biology , vol.10 , pp. R103
    • Maccallum, I.1    Przybylksi, D.2    Gnerre, S.3
  • 23
    • 77954044098 scopus 로고    scopus 로고
    • A genomic survey of positive selection in Burkholderia pseudomallei provides insights into the evolution of accidental virulence
    • Nandi, T., Ong, C., Singh, A.P., et al.: A genomic survey of positive selection in Burkholderia pseudomallei provides insights into the evolution of accidental virulence. PLoS Pathogens 6(4) (2010)
    • (2010) Plos Pathogens , vol.6 , Issue.4
    • Nandi, T.1    Ong, C.2    Singh, A.P.3
  • 24
    • 2942538300 scopus 로고    scopus 로고
    • Versatile and open software for comparing large genomes
    • Kurtz, S.A., Phillippy, A., Delcher, A.L., et al.: Versatile and open software for comparing large genomes. Genome Biology 5, R12 (2004)
    • (2004) Genome Biology , vol.5 , pp. R12
    • Kurtz, S.A.1    Phillippy, A.2    Delcher, A.L.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.