On the Common Substring Alignment Problem

DOI10.1006/jagm.2001.1191zbMath1017.68039WikidataQ56813214 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

68P10: Searching and sorting

Related Items

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