scientific article; zbMATH DE number 1617276

zbMATH Open0966.68606MaRDI QIDQ2721998FDOQ2721998

Authors: Claus Rick 

Publication date: 11 July 2001

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

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

Cited In (14)

• Algorithms for the longest common subsequence problem for multiple strings based on geometric maxima
• Enumeration of maximal common subsequences between two strings
• 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
• Title not available (Why is that?)
• Finding least-weight subsequences with fewer processors
• The set-set LCS problem
• Efficient algorithms for the longest common subsequence problem with sequential substring constraints
• Efficient algorithms for the longest common subsequence in \(k\)-length substrings
• RNA multiple structural alignment with longest common subsequences
• Computing the Longest Common Transposition-Invariant Subsequence with GPU
• Efficient merged longest common subsequence algorithms for similar sequences
• All Semi-local Longest Common Subsequences in Subquadratic Time
• A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem

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)