Efficient algorithms for folding and comparing nucleic acid sequences.
AUTOR(ES)
Dumas, J P
RESUMO
Fast algorithms for analysing sequence data are presented. An algorithm for strict homologies finds all common subsequences of length greater than or equal to 6 in two given sequences. With it, nucleic acid pieces five thousand nucleotides long can be compared in five seconds on CDC 6600. Secondary structure algorithms generate the N most stable secondary structures of an RNA molecule, taking into account all loop contributions, and the formation of all possible base-pairs in stems, including odd pairs (G.G., C.U., etc.). They allow a typical 100-nucleotide sequence to be analysed in 10 seconds. The homology and secondary structure programs are respectively illustrated with a comparison of two phage genomes, and a discussion of Drosophila melanogaster 55 RNA folding.
ACESSO AO ARTIGO
http://www.pubmedcentral.nih.gov/articlerender.fcgi?artid=326126Documentos Relacionados
- An efficient method for matching nucleic acid sequences.
- An interactive graphics program for comparing and aligning nucleic acid and amino acid sequences.
- Algorithms for the search of amino acid patterns in nucleic acid sequences.
- Computer programs for handling nucleic acid sequences.
- Pattern recognition in nucleic acid sequences. II. An efficient method for finding locally stable secondary structures.
