Efficient algorithms for folding and comparing nucleic acid sequences
J.R. Degorce Dumas, Jacques Ninio · Nucleic Acids Research · 1982
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.
Cited by 136 works. doi:10.1093/nar/10.1.197
Authors
References
- Nucleotide sequence of bacteriophage G4 DNA
- An improved method of testing for evolutionary homology
- Sequence data handling by computer
- Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information
- A computer program to search for tRNA genes.
- Nucleotide sequence of the filamentous bacteriophage M13 DNA genome: comparison with phage fd
- [60] Computer analysis of nucleic acids and proteins
- Method for predicting RNA secondary structure.
- Fast algorithm for predicting the secondary structure of single-stranded RNA.
- Steps Toward Computer Analysis of Nucleotide Sequences