All Semi-local Longest Common Subsequences in Subquadratic Time

DOI10.1007/11753728_36MaRDI QIDQ3434709zbMATH OpenOpenAlexFDO

Authors Alexander Tiskin

Publication date 2 May 2007

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11753728_36

Mathematics Subject Classification ID

Computational learning theory (68Q32) Algorithms on strings (68W32)

Recommendations

• Semi-local longest common subsequences in subquadratic time
• Semi-local string comparison: algorithmic techniques and applications
• An all-substrings common subsequence algorithm
• The longest common subsequence problem revisited
• scientific article; zbMATH DE number 1617276

Cited in

(5)

• Semi-local longest common subsequences in subquadratic time
• A data structure for substring-substring LCS length queries
• Fast distance multiplication of unit-Monge matrices
• An all-substrings common subsequence algorithm
• Semi-local string comparison: algorithmic techniques and applications

This page was built for publication: All Semi-local Longest Common Subsequences in Subquadratic Time

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