Dynamic programming algorithms for the mosaic longest common subsequence problem

DOI10.1016/J.IPL.2006.11.006zbMATH Open1187.90233OpenAlexW2144884743MaRDI QIDQ845973FDOQ845973

Authors: Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Yung-Hsing Peng, Hsing-Yen Ann 

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.11.006

Recommendations

• Algorithms for computing variants of the longest common subsequence problem
• Algorithms for Computing the Longest Parameterized Common Subsequence
• scientific article; zbMATH DE number 6161102
• Publication:4862293
• Maximal common subsequence algorithms
• Maximal common subsequence algorithms
• ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS
• The longest common subsequence problem revisited
• Algorithms for Computing Variants of the Longest Common Subsequence Problem
• A hyper-heuristic for the longest common subsequence problem

zbMATH Keywords

bioinformaticsdesign of algorithmsmosaic sequence

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Cites Work

• Algorithms on Strings, Trees and Sequences
• A linear space algorithm for computing maximal common subsequences
• Geometric applications of a matrix-searching algorithm
• On the common substring alignment problem
• The Complexity of Some Problems on Subsequences and Supersequences
• Sparse LCS common substring alignment

Cited In (8)

• Resequencing a set of strings based on a target string
• Finding the gapped longest common subsequence by incremental suffix maximum queries
• BIT-PARALLEL ALGORITHMS FOR THE MERGED LONGEST COMMON SUBSEQUENCE PROBLEM
• An algorithm and applications to sequence alignment with weighted constraints
• The generalized definitions of the two-dimensional largest common substructure problems
• Efficient merged longest common subsequence algorithms for similar sequences
• Efficient algorithms for the block edit problems
• Efficient algorithms for finding interleaving relationship between sequences

This page was built for publication: Dynamic programming algorithms for the mosaic longest common subsequence problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845973)