On the Common Substring Alignment Problem

DOI10.1006/jagm.2001.1191zbMath1017.68039DBLPjournals/jal/LandauZ01OpenAlexW1964444043WikidataQ56813214 ScholiaQ56813214MaRDI QIDQ2775894

Gad M. Landau, Michal Ziv-Ukelson

Publication date: 8 July 2002

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

Full work available at URL: https://semanticscholar.org/paper/3a12575933d208b716965a2ca8b50e6700317508

zbMATH Keywords

common substring alignment problem

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (21)

LCS\(k\): a refined similarity measure ⋮ A multiobjective optimization algorithm for the weighted LCS ⋮ Dynamic programming algorithms for the mosaic longest common subsequence problem ⋮ Efficient algorithms for finding interleaving relationship between sequences ⋮ Two algorithms for LCS consecutive suffix alignment ⋮ Multi-pattern matching with bidirectional indexes ⋮ Linear-space S-table algorithms for the longest common subsequence problem ⋮ A fast algorithm for multiplying min-sum permutations ⋮ Sequence Alignment Algorithms for Run-Length-Encoded Strings ⋮ An almost quadratic time algorithm for sparse spliced alignment ⋮ Efficient all path score computations on grid graphs ⋮ On almost Monge all scores matrices ⋮ An all-substrings common subsequence algorithm ⋮ LCS approximation via embedding into locally non-repetitive strings ⋮ Semi-local longest common subsequences in subquadratic time ⋮ LCS Approximation via Embedding into Local Non-repetitive Strings ⋮ Periodic String Comparison ⋮ Sparse LCS common substring alignment ⋮ Alignments with non-overlapping moves, inversions and tandem duplications in \(O(n^{4})\) time ⋮ Resequencing a set of strings based on a target string ⋮ A data structure for substring-substring LCS length queries

This page was built for publication: On the Common Substring Alignment Problem