A general edit distance between RNA structures

Journal of Computational Biology

Volumn 9, Issue 2, 2002, Pages 371-388

  Jiang, Tao ^a   Lin, Guohui ^b   Ma, Bin ^c   Zhang, Kaizhong ^c  

^a University of California Riverside   (United States)

^b UNIVERSITY OF ALBERTA   (Canada)

^c UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Approximation algorithm; Dynamic programming; Sequence annotation; String edit; Time efficiency

Indexed keywords

ALGORITHM; CALCULATION; CONFERENCE PAPER; PRIORITY JOURNAL; RNA CONFORMATION; RNA SEQUENCE; RNA STRUCTURE;

ALGORITHMS; BASE SEQUENCE; COMPUTATIONAL BIOLOGY; MOLECULAR SEQUENCE DATA; NUCLEIC ACID CONFORMATION; RNA; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, RNA;

EID: 0036100835     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/10665270252935511     Document Type: Article

References (28)

1. Hardness of approximating problems on cubic graphs
2. Computing similarity between RNA strings
3. The ribonuclease P database
4. Small subunit ribosomal RNA modeling using stochastic context-free grammars
5. RNAling program: Alignment of RNA sequences using both primary and secondary structures
6. Improved approximation algorithm for maximum cut and satisfiability problems using semidefinite programming
7. Algorithmic aspects of protein structure similarity
8. The longest common subsequence problem for arc-annotated sequences
9. Computing the edit-distance between unrooted ordered trees
10. A polyhedral approach to RNA sequence structure alignment
11. Binary codes capable of correcting insertions and reversals
12. The longest common subsequence problem for sequences with nested arc annotations
13. Optimization, approximation, and complexity classes
14. Recent methods for RNA modeling using stochastic context-free grammars
15. Simultaneous solution of the RNA folding, alignment, and protosequence problems
16. Comparing multiple RNA secondary structures using tree comparisons
17. Exact and approximate algorithms for unordered tree matching
18. Fast algorithms for the unit cost editing distance between trees
19. A constrained edit distance between unordered labeled trees
20. Efficient parallel algorithms for tree editing problems
21. Computing similarity between RNA secondary structures
22. On the editing distance between unordered labeled trees
23. On the editing distance between undirected acyclic graphs and related problems
24. Computing similarity between RNA structures
25. On finding all suboptimal foldings from an RNA molecule