RNA multiple structural alignment with longest common subsequences

DOI10.1007/s10878-006-9020-xzbMath1124.68112OpenAlexW1967690823MaRDI QIDQ2385486

Binhai Zhu, Sergey Bereg, Tomasz Walen, Marcin Kubica

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

zbMATH Keywords

Dynamic programmingLongest common subsequenceRNA multiple structure alignment

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Dynamic programming (90C39) Protein sequences, DNA sequences (92D20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing a longest common subsequence for a set of strings
• The constrained longest common subsequence problem
• A simple algorithm for the constrained sequence problems
• Finding similar regions in many strings
• A linear space algorithm for computing maximal common subsequences
• The Complexity of Some Problems on Subsequences and Supersequences
• Algorithms for Loop Matchings
• On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
• Approximation of RNA Multiple Structural Alignment
• Combinatorial Pattern Matching

This page was built for publication: RNA multiple structural alignment with longest common subsequences