Resequencing a set of strings based on a target string

DOI10.1007/s00453-013-9859-zzbMath1375.68232OpenAlexW2053244702MaRDI QIDQ2354022

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

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)

Cites Work

• Unnamed Item
• Dynamic programming algorithms for the mosaic longest common subsequence problem
• Geometric applications of a matrix-searching algorithm
• A faster algorithm computing string edit distances
• Perspectives of Monge properties in optimization
• Generalized LCS
• Monge properties, discrete convexity and applications
• An all-substrings common subsequence algorithm
• Finding a longest common subsequence between a run-length-encoded string and an uncompressed string
• On the Common Substring Alignment Problem
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity
• Bounds on the Complexity of the Longest Common Subsequence Problem
• Algorithms for the Longest Common Subsequence Problem
• Algorithms on Strings, Trees and Sequences
• The Parallel Evaluation of General Arithmetic Expressions
• The String-to-String Correction Problem
• An Optimal Decomposition Algorithm for Tree Edit Distance
• Weighted LCS