Cargando…
A fast adaptive algorithm for computing whole-genome homology maps
MOTIVATION: Whole-genome alignment is an important problem in genomics for comparing different species, mapping draft assemblies to reference genomes and identifying repeats. However, for large plant and animal genomes, this task remains compute and memory intensive. In addition, current practical m...
Autores principales: | Jain, Chirag, Koren, Sergey, Dilthey, Alexander, Phillippy, Adam M, Aluru, Srinivas |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Oxford University Press
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6129286/ https://www.ncbi.nlm.nih.gov/pubmed/30423094 http://dx.doi.org/10.1093/bioinformatics/bty597 |
Ejemplares similares
-
Fast characterization of segmental duplications in genome assemblies
por: Numanagić, Ibrahim, et al.
Publicado: (2018) -
fastp: an ultra-fast all-in-one FASTQ preprocessor
por: Chen, Shifu, et al.
Publicado: (2018) -
iCFN: an efficient exact algorithm for multistate protein design
por: Karimi, Mostafa, et al.
Publicado: (2018) -
Accurate and adaptive imputation of summary statistics in mixed-ethnicity cohorts
por: Togninalli, Matteo, et al.
Publicado: (2018) -
IRSOM, a reliable identifier of ncRNAs based on supervised self-organizing maps with rejection
por: Platon, Ludovic, et al.
Publicado: (2018)