Semi-local longest common subsequences in subquadratic time

DOI10.1016/J.JDA.2008.07.001MaRDI QIDQ1002102zbMATH OpenOpenAlexFDO

Authors Alexander Tiskin

Publication date 23 February 2009

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2008.07.001

zbMATH Keywords

longest common subsequencestring algorithmssemi-local string comparison

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• All 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
• A fast longest common subsequence algorithm for similar strings

Cites work

• scientific article; zbMATH DE number 5158495 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 801745 (Why is no real title available?)
• scientific article; zbMATH DE number 3340123 (Why is no real title available?)
• A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
• A dynamic edit distance table
• A faster algorithm computing string edit distances
• Algorithms on Strings, Trees and Sequences
• All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
• All Semi-local Longest Common Subsequences in Subquadratic Time
• Bounds on the Complexity of the Longest Common Subsequence Problem
• Combinatorial Pattern Matching
• Incremental String Comparison
• Multidimensional divide-and-conquer
• On the common substring alignment problem
• Perspectives of Monge properties in optimization
• Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting

Cited in

(19)

• A fast algorithm for multiplying min-sum permutations
• A substring-substring LCS data structure
• Towards approximate matching in compressed strings: local subsequence recognition
• Monge properties of sequence alignment
• An almost quadratic time algorithm for sparse spliced alignment
• Semi-local string comparison: algorithmic techniques and applications
• A data structure for substring-substring LCS length queries
• On almost Monge all scores matrices
• Longest Square Subsequence Problem Revisited
• LCS approximation via embedding into locally non-repetitive strings
• Computing longest common square subsequences
• Fast distance multiplication of unit-Monge matrices
• Bounded-length Smith-Waterman alignment
• Efficient all path score computations on grid graphs
• Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence
• An all-substrings common subsequence algorithm
• Periodic String Comparison
• All Semi-local Longest Common Subsequences in Subquadratic Time
• Faster subsequence recognition in compressed strings

This page was built for publication: 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 Q1002102)