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

Verónica Becher | Zendy; Alejandro Deymonnaz | Zendy; Pablo Ariel Heiber | Zendy

Open Access

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

Author(s) -

Verónica Becher,

Alejandro Deymonnaz,

Pablo Ariel Heiber

Publication year - 2009

Publication title -

bioinformatics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.599

H-Index - 390

eISSN - 1367-4811

pISSN - 1367-4803

DOI - 10.1093/bioinformatics/btp321

Subject(s) - ensembl , genome , homo sapiens , human genome , direct repeat , biology , chromosome , genetics , genomics , computational biology , computer science , gene , sociology , anthropology

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 chromosomes, but segments. Also, a quantitative framework for repetitive elements inside a genome or across genomes is still missing.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research