Two algorithms for LCS consecutive suffix alignment

DOI10.1016/J.JCSS.2007.03.004MaRDI QIDQ2643733zbMATH OpenOpenAlexFDO

Authors Gad M. Landau, Michal Ziv-Ukelson, Eugene W. Myers

Publication date 27 August 2007

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2007.03.004

zbMATH Keywords

dynamic programminglongest common subsequenceincremental algorithmsmatch point arithmetic

Mathematics Subject Classification ID

Dynamic programming (90C39) Searching and sorting (68P10)

Recommendations

• Combinatorial Pattern Matching
• Incremental String Comparison
• Fundamentals of Computation Theory
• A fast longest common subsequence algorithm for similar strings
• New algorithms for the LCS problem

Cites work

• scientific article; zbMATH DE number 1615270 (Why is no real title available?)
• scientific article; zbMATH DE number 2185637 (Why is no real title available?)
• scientific article; zbMATH DE number 1324671 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 1445380 (Why is no real title available?)
• A decomposition theorem for partially ordered sets
• A fast algorithm for computing longest common subsequences
• Algorithms for the Longest Common Subsequence Problem
• All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
• Incremental String Comparison
• On the common substring alignment problem
• Sparse LCS Common Substring Alignment
• Sparse dynamic programming II
• The longest common subsequence problem revisited

Cited in

(10)

• Monge properties of sequence alignment
• Combinatorial Pattern Matching
• scientific article; zbMATH DE number 2119727 (Why is no real title available?)
• Fundamentals of Computation Theory
• A multiobjective optimization algorithm for the weighted LCS
• Efficient all path score computations on grid graphs
• LCS\(k\): a refined similarity measure
• Linear-space S-table algorithms for the longest common subsequence problem
• On almost Monge all scores matrices
• Periodic String Comparison

This page was built for publication: Two algorithms for LCS consecutive suffix alignment

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