Purchased a strain from ATCC? Enter in the lot number to download the genome or learn more about our supporting memberships here.
Overview
Genome Browser
Related Genomes
Quality Control
| Organism Summary | |
|---|---|
| Catalog Number | ATCC® 43309™ |
| Strain Alias | 1384/1 |
| Isolation | Cod, Gadus morhua |
| Tags | Methylation Data |
| Biosafety Level | 1 |
| Type Strain | No |
| Assembly Summary | |
|---|---|
| Date Published | November 26, 2024 |
| Length | 4,018,840 nt |
| Sequencing Technology | Illumina + Oxford Nanopore Hybrid Assembly |
| Number of Contigs | 2 (0 Circularized) |
| N50 | 3,807,696 nt |
| %GC | 44.67% |
| Annotations Summary | |
|---|---|
| Number of CDS | 3446 |
| Number of Hypothetical Proteins | 252 |
| Number of tRNA | 106 |
| Number of 5s rRNA | 11 |
| Number of 16s rRNA | 10 |
| Number of 23s rRNA | 10 |
| Input Reads Summary | |
|---|---|
| Oxford Nanopore Read Count | 402,575 |
| Oxford Nanopore Median Q Score | 37 |
| Illumina Read Count | 4,694,104 |
| Illumina Mean Coverage Depth | 172.459× |
| Illumina Median Q Score | 40 |
| Contig | Start | End | Name | Protein Product | EC Number | Type | RefSeq ID | Jump |
|---|
Most similar genomes
The following genomes have the greatest genomic similarity to this one (≥95% average nucleotide identity):
All Genomes
| Taxonomic Name | ATCC Product Page | Strain Alias | Tags | Date Published | Length | Download |
|---|
Displaying Genome
| Sequencing Quality Control | |
|---|---|
| Number of trimmed reads | 4,694,104 |
| Median Q score, all bases | 40 |
| Percent of median Q scores per cycle greater than 25 | 1% |
| Ambiguous content (% N bases) | 0% |
| Assembly Quality Control | |
|---|---|
| Estimated genome completeness | 99.72% |
| Estimated genome contamination | 0.09% |
| Average depth of coverage | 172.459× |
Notes
This bacterium was assembled, annotated, and curated using Oatmeal v2.1. See our technical documentation for further details: https://docs.onecodex.com/en/articles/5357065-assembly-qc-and-annotation-pipeline-versions
This website uses cookies to ensure you get the best experience on our website. Learn moreDecline