RNA multiple structural alignment with longest common subsequences
From MaRDI portal
Publication:2385486
Recommendations
Cites work
- scientific article; zbMATH DE number 1617276 (Why is no real title available?)
- scientific article; zbMATH DE number 1305456 (Why is no real title available?)
- scientific article; zbMATH DE number 2086667 (Why is no real title available?)
- A linear space algorithm for computing maximal common subsequences
- A simple algorithm for the constrained sequence problems
- Algorithms for Loop Matchings
- Approximation of RNA Multiple Structural Alignment
- Combinatorial Pattern Matching
- Computing a longest common subsequence for a set of strings
- Finding similar regions in many strings
- Introduction to algorithms
- On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
- The Complexity of Some Problems on Subsequences and Supersequences
- The constrained longest common subsequence problem
Cited in
(5)
This page was built for publication: RNA multiple structural alignment with longest common subsequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2385486)