Resequencing a set of strings based on a target string

DOI10.1007/S00453-013-9859-ZMaRDI QIDQ2354022zbMATH OpenOpenAlexFDO

Authors Chih-En Kuo, Yue-Li Wang, Jia-Jie Liu, Ming-Tat Ko

Publication date 10 July 2015

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-013-9859-z

zbMATH Keywords

dynamic programminglongest common subsequencesresequencinginverted indexingtotally monotone matrices

Mathematics Subject Classification ID

Dynamic programming (90C39) Algorithms on strings (68W32)

Recommendations

• Efficient algorithms for the longest common subsequence in \(k\)-length substrings
• A large neighborhood search heuristic for the longest common subsequence problem
• The set-set LCS problem
• Dynamic programming algorithms for the mosaic longest common subsequence problem
• The constrained longest common subsequence problem

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• A faster algorithm computing string edit distances
• Algorithms for the Longest Common Subsequence Problem
• Algorithms on Strings, Trees and Sequences
• An Optimal Decomposition Algorithm for Tree Edit Distance
• An all-substrings common subsequence algorithm
• Bounds on the Complexity of the Longest Common Subsequence Problem
• Dynamic programming algorithms for the mosaic longest common subsequence problem
• Finding a longest common subsequence between a run-length-encoded string and an uncompressed string
• Generalized LCS
• Geometric applications of a matrix-searching algorithm
• Monge properties, discrete convexity and applications
• On the common substring alignment problem
• Perspectives of Monge properties in optimization
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity
• The Parallel Evaluation of General Arithmetic Expressions
• The String-to-String Correction Problem
• Weighted LCS (extended abstract)

This page was built for publication: Resequencing a set of strings based on a target string

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