RNA multiple structural alignment with longest common subsequences
From MaRDI portal
Publication:2385486
DOI10.1007/S10878-006-9020-XzbMATH Open1124.68112OpenAlexW1967690823MaRDI QIDQ2385486FDOQ2385486
Binhai Zhu, Tomasz Waleń, Marcin Kubica, Sergey Bereg
Publication date: 12 October 2007
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-006-9020-x
Recommendations
Protein sequences, DNA sequences (92D20) Analysis of algorithms (68W40) Dynamic programming (90C39) Nonnumerical algorithms (68W05)
Cites Work
- Introduction to algorithms
- A linear space algorithm for computing maximal common subsequences
- The constrained longest common subsequence problem
- The Complexity of Some Problems on Subsequences and Supersequences
- A simple algorithm for the constrained sequence problems
- Finding similar regions in many strings
- Title not available (Why is that?)
- Algorithms for Loop Matchings
- Computing a longest common subsequence for a set of strings
- Approximation of RNA Multiple Structural Alignment
- On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
- Title not available (Why is that?)
- Combinatorial Pattern Matching
- Title not available (Why is that?)
Cited In (3)
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)