Semi-local longest common subsequences in subquadratic time
type: Item
instance of: scholarly article
title: Semi-local longest common subsequences in subquadratic time
zbMATH Open document ID: 1154.68543
author: Alexander Tiskin
published in: Journal of Discrete Algorithms
publication date: 2009-02-23T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5509888
zbMATH Keywords: string algorithms
zbMATH Keywords: longest common subsequence
zbMATH Keywords: semi-local string comparison
MaRDI profile type: Publication
full work available at URL: j.jda.2008.07.001
OpenAlex ID: W2066688636
cites work: Bounds on the Complexity of the Longest Common Subsequence Problem
cites work: Q3439674
cites work: Q5616735
cites work: Multidimensional divide-and-conquer
cites work: Perspectives of Monge properties in optimization
cites work: A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
cites work: Q4849531
cites work: Algorithms on Strings, Trees and Sequences
cites work: Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
cites work: A dynamic edit distance table
cites work: Combinatorial Pattern Matching
cites work: Incremental String Comparison
cites work: On the common substring alignment problem
cites work: A faster algorithm computing string edit distances
cites work: Q3992847
cites work: All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
cites work: All Semi-local Longest Common Subsequences in Subquadratic Time
DOI: 10.1016/J.JDA.2008.07.001
description: scientific article; zbMATH DE number 5509888