On the longest common rigid subsequence problem
From MaRDI portal
Publication:848965
DOI10.1007/S00453-008-9175-1zbMATH Open1191.68216OpenAlexW2159782909MaRDI QIDQ848965FDOQ848965
Authors: N. Bansal, Moshe Lewenstein, Bin Ma, Kaizhong Zhang 
Publication date: 23 February 2010
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-008-9175-1
Recommendations
approximation algorithmslongest common subsequencemotif findinglongest common rigid subsequencepattern matching and computational biology
Cites Work
- Optimization, approximation, and complexity classes
- Some APX-completeness results for cubic graphs
- Distinguishing string selection problems.
- On the closest string and substring problems
- Derandomized graph products
- The Complexity of Some Problems on Subsequences and Supersequences
- Finding similar regions in many strings
- Finding similar regions in many sequences
- Title not available (Why is that?)
- On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
- Combinatorial Pattern Matching
- Pattern recognition in several sequences: Consensus and alignment
- Title not available (Why is that?)
Cited In (7)
- Title not available (Why is that?)
- Hardness of longest common subsequence for sequences with bounded run-lengths
- The longest filled common subsequence problem
- Quick greedy computation for minimum common string partition
- Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs
- On the Longest Common Parameterized Subsequence
- Combinatorial Pattern Matching
Uses Software
This page was built for publication: On the longest common rigid subsequence problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848965)
