scientific article

zbMATH Open1171.68840MaRDI QIDQ3621522

Afroza Begum

Publication date: 21 April 2009

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

zbMATH Keywords

greedy algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)

Related Items (4)

On the Approximation of Shortest Common Supersequences and Longest Common Subsequences ⋮ A Scalable Approximation Algorithm for Weighted Longest Common Subsequence ⋮ A learning algorithm for the longest common subsequence problem ⋮ Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A hyper-heuristic for the longest common subsequence problem 👍 👎
• A new efficient algorithm for computing the longest common subsequence 👍 👎
• A fast algorithm for computing a longest common increasing subsequence 👍 👎
• Algorithms for computing variants of the longest common subsequence problem 👍 👎
• Efficient algorithms for the longest common subsequence problem with sequential substring constraints 👍 👎
• An efficient algorithm for enumerating longest common increasing subsequences 👍 👎
• Algorithms for Computing the Longest Parameterized Common Subsequence 👍 👎
• A New Efficient Algorithm for Computing the Longest Common Subsequence 👍 👎

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