Efficient computation of all perfect repeats in genomic sequences of up to half a gigabyte, with a case study on the human genome

Motivation: There is a significant ongoing research to identify the number and types of repetitive DNA sequences. As more genomes are sequenced, efficiency and scalability in computational tools become mandatory. Existing tools fail to find distant repeats because they cannot accommodate whole chrom...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Becher, V., Deymonnaz, A., Heiber, P.
Formato: JOUR
Materias:
article
bioinformatics
computer program
controlled study
gene sequence
genetic algorithm
human
human chromosome
human genome
intermethod comparison
nucleotide repeat
priority journal
Algorithms
Genome, Human
Genomics
Humans
Repetitive Sequences, Nucleic Acid
Homo sapiens
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_13674803_v25_n14_p1746_Becher
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares