Cargando…
A novel codon-based de Bruijn graph algorithm for gene construction from unassembled transcriptomes
Most gene prediction methods detect coding sequences from transcriptome assemblies in the absence of closely related reference genomes. Such methods are of limited application due to high transcript fragmentation and extensive assembly errors, which may lead to redundant or false coding sequence pre...
Autores principales: | Peng, Gongxin, Ji, Peifeng, Zhao, Fangqing |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2016
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5114782/ https://www.ncbi.nlm.nih.gov/pubmed/27855707 http://dx.doi.org/10.1186/s13059-016-1094-x |
Ejemplares similares
-
Extremely fast construction and querying of compacted and colored de Bruijn graphs with GGCAT
por: Cracco, Andrea, et al.
Publicado: (2023) -
Simplitigs as an efficient and scalable representation of de Bruijn graphs
por: Břinda, Karel, et al.
Publicado: (2021) -
Scalable, ultra-fast, and low-memory construction of compacted de Bruijn graphs with Cuttlefish 2
por: Khan, Jamshed, et al.
Publicado: (2022) -
deSALT: fast and accurate long transcriptomic read alignment with de Bruijn graph-based index
por: Liu, Bo, et al.
Publicado: (2019) -
Amino acid based de Bruijn graph algorithm for identifying complete coding genes from metagenomic and metatranscriptomic short reads
por: Liu, Jiemeng, et al.
Publicado: (2019)