Two algorithms for LCS consecutive suffix alignment

DOI10.1007/978-3-540-27801-6_13MaRDI QIDQ5315326zbMATH OpenFDO

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

Publication date 7 September 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-27801-6_13

Mathematics Subject Classification ID

Combinatorics on words (68R15) Nonnumerical algorithms (68W05)

Recommendations

• Two algorithms for LCS consecutive suffix alignment
• Incremental String Comparison
• Fundamentals of Computation Theory
• A fast longest common subsequence algorithm for similar strings
• New algorithms for the LCS problem

Cited in

(11)

• Semi-local longest common subsequences in subquadratic time
• Efficient merged longest common subsequence algorithms for similar sequences
• A space efficient algorithm for the longest common subsequence in \(k\)-length substrings
• Efficient algorithms for finding interleaving relationship between sequences
• Two algorithms for LCS consecutive suffix alignment
• LCSk: a refined similarity measure
• Alignments and approximate string matching
• Incremental String Comparison
• scientific article; zbMATH DE number 1445380 (Why is no real title available?)
• Fundamentals of Computation Theory
• Linear-space S-table algorithms for the longest common subsequence problem

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 Q5315326)