On the common substring alignment problem

DOI10.1006/JAGM.2001.1191MaRDI QIDQ2775894zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1445380
• On all-substrings alignment problems
• Sparse LCS common substring alignment
• Sparse LCS Common Substring Alignment
• Sublinear space algorithms for the longest common substring problem
• A linear-space algorithm for the substring constrained alignment problem
• An all-substrings common subsequence algorithm
• On the complexity of finding common approximate substrings.
• Alignments and approximate string matching

Cited in

(26)

• 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
• A linear-space algorithm for the substring constrained alignment problem
• A data structure for substring-substring LCS length queries
• 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
• LCSk: a refined similarity measure
• On all-substrings alignment problems
• A multiobjective optimization algorithm for the weighted LCS
• Sequence Alignment Algorithms for Run-Length-Encoded Strings
• Sparse LCS Common Substring Alignment
• LCS Approximation via Embedding into Local Non-repetitive Strings
• Periodic String Comparison
• Multi-pattern matching with bidirectional indexes
• A fast algorithm for multiplying min-sum permutations
• scientific article; zbMATH DE number 1445380 (Why is no real title available?)
• Linear-space S-table algorithms for the longest common subsequence problem
• LCS approximation via embedding into locally non-repetitive strings
• Core-sparse Monge matrix multiplication: improved algorithm and applications
• Dynamic programming algorithms for the mosaic longest common subsequence problem

This page was built for publication: On the common substring alignment problem

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