Computing similarity between RNA structures
Authors:
- Bin MaBMBin Ma
- Lusheng WangLWLusheng Wang
- Kaizhong ZhangKZKaizhong Zhang
- 1 April 2002
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 276 (1-2) , 111-132
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Computing the Edit-Distance Between Unrooted Ordered Trees1998
- On the complexity of comparing evolutionary treesDiscrete Applied Mathematics, 1996
- Computing similarity between RNA strings1995
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Simple Fast Algorithms for the Editing Distance between Trees and Related ProblemsSIAM Journal on Computing, 1989
- Tree graphs of RNA secondary structures and their comparisonsComputers and Biomedical Research, 1989
- Comparison of biosequencesAdvances in Applied Mathematics, 1981
- Identification of common molecular subsequencesJournal of Molecular Biology, 1981
- The Tree-to-Tree Correction ProblemJournal of the ACM, 1979
- A general method applicable to the search for similarities in the amino acid sequence of two proteinsJournal of Molecular Biology, 1970