Dynamic programming algorithms for the mosaic longest common subsequence problem
type: Item
instance of: scholarly article
title: Dynamic programming algorithms for the mosaic longest common subsequence problem
zbMATH Open document ID: 1187.90233
author: Kuo-Si Huang
author: Chang-Biau Yang
author: Kuo-Tsung Tseng
author: Yung-Hsing Peng
author: Hsing-Yen Ann
published in: Information Processing Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 5664786
zbMATH Keywords: bioinformatics
zbMATH Keywords: mosaic sequence
zbMATH Keywords: design of algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2006.11.006
OpenAlex ID: W2144884743
cites work: Geometric applications of a matrix-searching algorithm
cites work: Algorithms on Strings, Trees and Sequences
cites work: A linear space algorithm for computing maximal common subsequences
cites work: Sparse LCS common substring alignment
cites work: On the common substring alignment problem
cites work: The Complexity of Some Problems on Subsequences and Supersequences
DOI: 10.1016/J.IPL.2006.11.006
Recommended article: Algorithms for computing variants of the longest common subsequence problem
Recommended article: Algorithms for Computing the Longest Parameterized Common Subsequence
Recommended article: Q4918894
Recommended article: Q4862293
Recommended article: Maximal common subsequence algorithms
Recommended article: Maximal Common Subsequence Algorithms
Recommended article: ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS
Recommended article: The longest common subsequence problem revisited
Recommended article: Algorithms for Computing Variants of the Longest Common Subsequence Problem
Recommended article: A hyper-heuristic for the longest common subsequence problem
description: scientific article; zbMATH DE number 5664786