On the longest common rigid subsequence problem
type: Item
instance of: scholarly article
title: On the longest common rigid subsequence problem
zbMATH Open document ID: 1191.68216
author: N. Bansal
author: Moshe Lewenstein
author: Bin Ma
author: Kaizhong Zhang
published in: Algorithmica
publication date: 2010-02-23T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68T10
zbMATH DE Number: 5674337
zbMATH Keywords: longest common subsequence
zbMATH Keywords: longest common rigid subsequence
zbMATH Keywords: approximation algorithms
zbMATH Keywords: motif finding
zbMATH Keywords: pattern matching and computational biology
describes a project that uses: TEIRESIAS
MaRDI profile type: Publication
full work available at URL: s00453-008-9175-1
OpenAlex ID: W2159782909
cites work: Q4410124
cites work: Some APX-completeness results for cubic graphs
cites work: Derandomized graph products
cites work: On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
cites work: Distinguishing string selection problems.
cites work: Finding similar regions in many strings
cites work: Finding similar regions in many sequences
cites work: On the closest string and substring problems
cites work: Q2723943
cites work: Combinatorial Pattern Matching
cites work: The Complexity of Some Problems on Subsequences and Supersequences
cites work: Optimization, approximation, and complexity classes
cites work: Pattern recognition in several sequences: Consensus and alignment
DOI: 10.1007/S00453-008-9175-1
description: scientific article; zbMATH DE number 5674337