Use este identificador para citar ou linkar para este item: http://www.alice.cnptia.embrapa.br/alice/handle/doc/908712
Unidade da Embrapa/Coleção:: Embrapa Informática Agropecuária - Resumo em anais de congresso (ALICE)
Data do documento: 6-Dez-2011
Tipo do Material: Resumo em anais de congresso (ALICE)
Autoria: NARCISO, M.
YAMAGISHI, M.
Informaçães Adicionais: MARCELO GONCALVES NARCISO, CNPAF; MICHEL EDUARDO BELEZA YAMAGISHI, CNPTIA.
Título: A fast algorithm to "de novo" genome wide tandem repeats discovery.
Edição: 2011
Fonte/Imprenta: In: INTERNATIONAL CONFERENCE OF THE BRAZILIAN ASSOCIATION FOR BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, 7.; INTERNATIONAL CONFERENCE OF THE IBEROAMERICAN SOCIETY FOR BIOINFORMATICS, 3., 2011, Florianópolis. Proceedings... Florianópolis: Associação Brasileira de Bioinformática e Biologia Computacional, 2011.
Idioma: en
Notas: X-MEETING 2011.
Palavras-chave: Algoritmo
Marcadores genéticos
Polimorfismo de nucleotídeo único
Repetições em Tandem
Conteúdo: Tandem Repeats (TR) are sequences where the same pattern repeats consecutively. They have been used as genomic markers (microsatellite and minisatéllite) since the begining of the genomic era. Recently, new studies have associated TR to important regulatory processes which substantialy increased the interest in TR. The exponential reduction cost of sequencing caused by the new technologies, resulted in the proliferation of genome projects, and particularly of novel model organisms. Very often, the first sequence analysis is the identification of genetic markers such as SNPs and TRs. As the former is a by product of the assembly phase, the real chalenge resides in the latter since the TRs identification must be done de novo. This scenario requires a faster and more efficient algorithms to perform de novo TR discovery. In this paper, we propose a new strategy to address this problem. Our algorithm is able to deal with large genomes in a reduced computational time (on average 30% to 50% faster than other the approaches). Furthermore, our algorithm finds all TR in a genome while some popular algorithms do not as will be shown. Consequently, as our algorithm is faster and find all TR, it may be used in new genomes and old genomes as well to discover eventually missed TR.
NAL Thesaurus: Algorithms
Microsatellite repeats
Genetic markers
Tandem repeat sequences
Single nucleotide polymorphism
Ano de Publicação: 2011
Aparece nas coleções:Resumo em anais de congresso (CNPTIA)

Arquivos associados a este item:
Arquivo Descrição TamanhoFormato 
denovo.pdf32,19 kBAdobe PDFThumbnail
Visualizar/Abrir

FacebookTwitterDeliciousGoogle BookmarksMySpace