Cargando…
Finding all maximal perfect haplotype blocks in linear time
Recent large-scale community sequencing efforts allow at an unprecedented level of detail the identification of genomic regions that show signatures of natural selection. Traditional methods for identifying such regions from individuals’ haplotype data, however, require excessive computing times and...
Autores principales: | Alanko, Jarno, Bannai, Hideo, Cazaux, Bastien, Peterlongo, Pierre, Stoye, Jens |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7008532/ https://www.ncbi.nlm.nih.gov/pubmed/32055252 http://dx.doi.org/10.1186/s13015-020-0163-6 |
Ejemplares similares
-
HaploBlocks: Efficient Detection of Positive Selection in Large Population Genomic Datasets
por: Kirsch-Gerweck, Benedikt, et al.
Publicado: (2023) -
Maximal Perfect Haplotype Blocks with Wildcards
por: Williams, Lucia, et al.
Publicado: (2020) -
Extending Maximal Perfect Haplotype Blocks to the Realm of Pangenomics
por: Williams, Lucia, et al.
Publicado: (2020) -
Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time
por: Schmidt, Sebastian, et al.
Publicado: (2023) -
Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time
por: Schmidt, Sebastian, et al.
Publicado: (2023)