Use este identificador para citar ou linkar para este item: http://www.alice.cnptia.embrapa.br/alice/handle/doc/909360
Registro completo de metadados
Campo DCValorIdioma
dc.contributor.authorNARCISO, M.pt_BR
dc.contributor.authorYAMAGISHI, M.pt_BR
dc.date.accessioned2011-12-12T11:11:11Zpt_BR
dc.date.accessioned2011-12-12T11:11:11Zpt_BR
dc.date.available2011-12-12T11:11:11Zpt_BR
dc.date.available2011-12-12T11:11:11Zpt_BR
dc.date.created2011-12-12pt_BR
dc.date.issued2011pt_BR
dc.identifier.citationIn: 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.pt_BR
dc.identifier.urihttp://www.alice.cnptia.embrapa.br/alice/handle/doc/909360pt_BR
dc.descriptionTandem 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.pt_BR
dc.language.isoengeng
dc.rightsopenAccesseng
dc.subjectAlgoritmopt_BR
dc.subjectMarcadores genéticospt_BR
dc.subjectPolimorfismo de nucleotídeo únicopt_BR
dc.subjectRepetições em Tandempt_BR
dc.titleA fast algorithm to "de novo" genome wide tandem repeats discovery.pt_BR
dc.typeResumo em anais e proceedingspt_BR
dc.date.updated2011-12-12T11:11:11Zpt_BR
dc.subject.nalthesaurusAlgorithmspt_BR
dc.subject.nalthesaurusMicrosatellite repeatspt_BR
dc.subject.nalthesaurusGenetic markerspt_BR
dc.subject.nalthesaurusTandem repeat sequencespt_BR
dc.subject.nalthesaurusSingle nucleotide polymorphismpt_BR
dc.description.notesX-MEETING 2011.pt_BR
riaa.ainfo.id909360pt_BR
riaa.ainfo.lastupdate2011-12-12pt_BR
dc.contributor.institutionMARCELO GONCALVES NARCISO, CNPAF; MICHEL EDUARDO BELEZA YAMAGISHI, CNPTIA.pt_BR
Aparece nas coleções:Resumo em anais de congresso (CNPAF)

Arquivos associados a este item:
Arquivo Descrição TamanhoFormato 
denovo.pdf32,19 kBAdobe PDFThumbnail
Visualizar/Abrir
Mostrar registro simples do item Visualizar estatísticas

FacebookTwitterDeliciousGoogle BookmarksMySpace