Assemblathon 1: A competitive assessment of de novo short read assembly methods
Earl, D
Bradnam, K
St. John, J
Darling, A
Lin, D
Fass, J
Yu, HOK
Buffalo, V
Zerbino, DR
Diekhans, M
Nguyen, N
Ariyaratne, PN
Sung, WK
Ning, Z
Haimel, M
Simpson, JT
Fonseca, NA
Birol, I
Docking, TR
Ho, IY
Rokhsar, DS
Chikhi, R
Lavenier, D
Chapuis, G
Naquin, D
Maillet, N
Schatz, MC
Kelley, DR
Phillippy, AM
Koren, S
Yang, SP
Wu, W
Chou, WC
Srivastava, A
Shaw, TI
Ruby, JG
Skewes-Cox, P
Betegon, M
Dimon, MT
Solovyev, V
Seledtsov, I
Kosarev, P
Vorobyev, D
Ramirez-Gonzalez, R
Leggett, R
MacLean, D
Xia, F
Luo, R
Li, Z
Xie, Y
Liu, B
Gnerre, S
MacCallum, I
Przybylski, D
Ribeiro, FJ
Sharpe, T
Hall, G
Kersey, PJ
Durbin, R
Jackman, SD
Chapman, JA
Huang, X
DeRisi, JL
Caccamo, M
Li, Y
Jaffe, DB
Green, RE
Haussler, D
Korf, I
Paten, B
- Publication Type:
- Journal Article
- Citation:
- Genome Research, 2011, 21 (12), pp. 2224 - 2241
- Issue Date:
- 2011-12-01
Closed Access
Filename | Description | Size | |||
---|---|---|---|---|---|
2012004816OK.pdf | Published Version | 1.66 MB | Adobe PDF |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
Full metadata record
Field | Value | Language |
---|---|---|
dc.contributor.author | Earl, D | en_US |
dc.contributor.author | Bradnam, K | en_US |
dc.contributor.author | St. John, J | en_US |
dc.contributor.author |
Darling, A https://orcid.org/0000-0003-2397-7925 |
en_US |
dc.contributor.author | Lin, D | en_US |
dc.contributor.author | Fass, J | en_US |
dc.contributor.author | Yu, HOK | en_US |
dc.contributor.author | Buffalo, V | en_US |
dc.contributor.author | Zerbino, DR | en_US |
dc.contributor.author | Diekhans, M | en_US |
dc.contributor.author | Nguyen, N | en_US |
dc.contributor.author | Ariyaratne, PN | en_US |
dc.contributor.author | Sung, WK | en_US |
dc.contributor.author | Ning, Z | en_US |
dc.contributor.author | Haimel, M | en_US |
dc.contributor.author | Simpson, JT | en_US |
dc.contributor.author | Fonseca, NA | en_US |
dc.contributor.author | Birol, I | en_US |
dc.contributor.author | Docking, TR | en_US |
dc.contributor.author |
Ho, IY https://orcid.org/0000-0003-2397-7925 |
en_US |
dc.contributor.author | Rokhsar, DS | en_US |
dc.contributor.author | Chikhi, R | en_US |
dc.contributor.author | Lavenier, D | en_US |
dc.contributor.author | Chapuis, G | en_US |
dc.contributor.author | Naquin, D | en_US |
dc.contributor.author | Maillet, N | en_US |
dc.contributor.author | Schatz, MC | en_US |
dc.contributor.author | Kelley, DR | en_US |
dc.contributor.author | Phillippy, AM | en_US |
dc.contributor.author | Koren, S | en_US |
dc.contributor.author | Yang, SP | en_US |
dc.contributor.author | Wu, W | en_US |
dc.contributor.author | Chou, WC | en_US |
dc.contributor.author | Srivastava, A | en_US |
dc.contributor.author | Shaw, TI | en_US |
dc.contributor.author | Ruby, JG | en_US |
dc.contributor.author | Skewes-Cox, P | en_US |
dc.contributor.author | Betegon, M | en_US |
dc.contributor.author | Dimon, MT | en_US |
dc.contributor.author | Solovyev, V | en_US |
dc.contributor.author | Seledtsov, I | en_US |
dc.contributor.author | Kosarev, P | en_US |
dc.contributor.author | Vorobyev, D | en_US |
dc.contributor.author | Ramirez-Gonzalez, R | en_US |
dc.contributor.author | Leggett, R | en_US |
dc.contributor.author | MacLean, D | en_US |
dc.contributor.author | Xia, F | en_US |
dc.contributor.author | Luo, R | en_US |
dc.contributor.author | Li, Z | en_US |
dc.contributor.author | Xie, Y | en_US |
dc.contributor.author | Liu, B | en_US |
dc.contributor.author | Gnerre, S | en_US |
dc.contributor.author | MacCallum, I | en_US |
dc.contributor.author | Przybylski, D | en_US |
dc.contributor.author | Ribeiro, FJ | en_US |
dc.contributor.author | Sharpe, T | en_US |
dc.contributor.author | Hall, G | en_US |
dc.contributor.author | Kersey, PJ | en_US |
dc.contributor.author | Durbin, R | en_US |
dc.contributor.author | Jackman, SD | en_US |
dc.contributor.author | Chapman, JA | en_US |
dc.contributor.author | Huang, X | en_US |
dc.contributor.author | DeRisi, JL | en_US |
dc.contributor.author | Caccamo, M | en_US |
dc.contributor.author | Li, Y | en_US |
dc.contributor.author | Jaffe, DB | en_US |
dc.contributor.author | Green, RE | en_US |
dc.contributor.author | Haussler, D | en_US |
dc.contributor.author | Korf, I | en_US |
dc.contributor.author | Paten, B | en_US |
dc.date.issued | 2011-12-01 | en_US |
dc.identifier.citation | Genome Research, 2011, 21 (12), pp. 2224 - 2241 | en_US |
dc.identifier.issn | 1088-9051 | en_US |
dc.identifier.uri | http://hdl.handle.net/10453/30741 | |
dc.description.abstract | Low-cost short read sequencing technology has revolutionized genomics, though it is only just becoming practical for the high-quality de novo assembly of a novel large genome. We describe the Assemblathon 1 competition, which aimed to comprehensively assess the state of the art in de novo assembly methods when applied to current sequencing technologies. In a collaborative effort, teams were asked to assemble a simulated Illumina HiSeq data set of an unknown, simulated diploid genome. A total of 41 assemblies from 17 different groups were received. Novel haplotype aware assessments of coverage, contiguity, structure, base calling, and copy number were made. We establish that within this benchmark: (1) It is possible to assemble the genome to a high level of coverage and accuracy, and that (2) large differences exist between the assemblies, suggesting room for further improvements in current methods. The simulated benchmark, including the correct answer, the assemblies, and the code that was used to evaluate the assemblies is now public and freely available from http://www.assemblathon.org/. © 2011 by Cold Spring Harbor Laboratory Press. | en_US |
dc.relation.ispartof | Genome Research | en_US |
dc.relation.isbasedon | 10.1101/gr.126599.111 | en_US |
dc.subject.classification | Bioinformatics | en_US |
dc.subject.mesh | Sequence Analysis, DNA | en_US |
dc.subject.mesh | Genomics | en_US |
dc.subject.mesh | Genome | en_US |
dc.title | Assemblathon 1: A competitive assessment of de novo short read assembly methods | en_US |
dc.type | Journal Article | |
utslib.citation.volume | 12 | en_US |
utslib.citation.volume | 21 | en_US |
utslib.for | 0605 Microbiology | en_US |
utslib.for | 06 Biological Sciences | en_US |
utslib.for | 11 Medical and Health Sciences | en_US |
pubs.embargo.period | Not known | en_US |
pubs.organisational-group | /University of Technology Sydney | |
pubs.organisational-group | /University of Technology Sydney/Faculty of Science | |
pubs.organisational-group | /University of Technology Sydney/Strength - ithree - Institute of Infection, Immunity and Innovation | |
utslib.copyright.status | closed_access | |
pubs.issue | 12 | en_US |
pubs.publication-status | Published | en_US |
pubs.volume | 21 | en_US |
Abstract:
Low-cost short read sequencing technology has revolutionized genomics, though it is only just becoming practical for the high-quality de novo assembly of a novel large genome. We describe the Assemblathon 1 competition, which aimed to comprehensively assess the state of the art in de novo assembly methods when applied to current sequencing technologies. In a collaborative effort, teams were asked to assemble a simulated Illumina HiSeq data set of an unknown, simulated diploid genome. A total of 41 assemblies from 17 different groups were received. Novel haplotype aware assessments of coverage, contiguity, structure, base calling, and copy number were made. We establish that within this benchmark: (1) It is possible to assemble the genome to a high level of coverage and accuracy, and that (2) large differences exist between the assemblies, suggesting room for further improvements in current methods. The simulated benchmark, including the correct answer, the assemblies, and the code that was used to evaluate the assemblies is now public and freely available from http://www.assemblathon.org/. © 2011 by Cold Spring Harbor Laboratory Press.
Please use this identifier to cite or link to this item:
Download statistics for the last 12 months
Not enough data to produce graph