Cargando…
Linear time minimum segmentation enables scalable founder reconstruction
BACKGROUND: We study a preprocessing routine relevant in pan-genomic analyses: consider a set of aligned haplotype sequences of complete human chromosomes. Due to the enormous size of such data, one would like to represent this input set with a few founder sequences that retain as well as possible...
Autores principales: | Norri, Tuukka, Cazaux, Bastien, Kosolobov, Dmitry, Mäkinen, Veli |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6525415/ https://www.ncbi.nlm.nih.gov/pubmed/31131017 http://dx.doi.org/10.1186/s13015-019-0147-6 |
Ejemplares similares
-
Founder reconstruction enables scalable and seamless pangenomic analysis
por: Norri, Tuukka, et al.
Publicado: (2021) -
Evaluating approaches to find exon chains based on long reads
por: Kuosmanen, Anna, et al.
Publicado: (2017) -
Towards pan-genome read alignment to improve variation calling
por: Valenzuela, Daniel, et al.
Publicado: (2018) -
Finding all maximal perfect haplotype blocks in linear time
por: Alanko, Jarno, et al.
Publicado: (2020) -
On the complexity of Minimum Path Cover with Subpath Constraints for multi-assembly
por: Rizzi, Romeo, et al.
Publicado: (2014)