scientific article; zbMATH DE number 1617276

MaRDI QIDQ2721998zbMATH OpenFDO

Authors Claus Rick

Publication date 11 July 2001

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics on words (68R15)

Recommendations

• Algorithms for the longest common subsequence problem for multiple strings based on geometric maxima
• The longest common subsequence problem revisited
• Algorithms for Computing Variants of the Longest Common Subsequence Problem
• Publication:4862293
• Fast linear-space computations of longest common subsequences

Cited in

(14)

• All Semi-local Longest Common Subsequences in Subquadratic Time
• Algorithms for the longest common subsequence problem for multiple strings based on geometric maxima
• Enumeration of maximal common subsequences between two strings
• Efficient merged longest common subsequence algorithms for similar sequences
• Computing the Longest Common Transposition-Invariant Subsequence with GPU
• Efficient algorithms for the longest common subsequence in \(k\)-length substrings
• Finding least-weight subsequences with fewer processors
• The set-set LCS problem
• Efficient algorithms for the longest common subsequence problem with sequential substring constraints
• scientific article; zbMATH DE number 5545474 (Why is no real title available?)
• On the reconstruction of optimal solutions in methods of dynamic programming for the sequence analysis
• The colored longest common prefix array computed via sequential scans
• A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem
• RNA multiple structural alignment with longest common subsequences

This page was built for publication:

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