A learning algorithm for the longest common subsequence problem

DOI10.1145/996546.996552MaRDI QIDQ5463438zbMATH OpenOpenAlexFDO

Authors Eric A. Breimer, Mark K. Goldberg, Darren T. Lim

Publication date 4 August 2005

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL http://www.acm.org/jea/2003/BreimerLearning/

zbMATH Keywords

learning algorithmlongest common subsequence

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Analysis of algorithms (68W40)

Recommendations

• Publication:4862293
• An improved algorithm for the longest common subsequence problem
• A new efficient algorithm for computing the longest common subsequence
• A New Efficient Algorithm for Computing the Longest Common Subsequence
• Algorithms for Computing the Longest Parameterized Common Subsequence
• Algorithms for computing variants of the longest common subsequence problem
• scientific article; zbMATH DE number 5545474
• The longest common subsequence problem revisited
• A hyper-heuristic for the longest common subsequence problem
• ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS

Cites work

• A fast algorithm for computing longest common subsequences
• A faster algorithm computing string edit distances
• A linear space algorithm for computing maximal common subsequences
• A longest common subsequence algorithm suitable for similar text strings
• A theory of the learnable
• Algorithms for approximate string matching
• Algorithms for the Longest Common Subsequence Problem
• An \(O(ND)\) difference algorithm and its variations
• An O(NP) sequence comparison algorithm
• scientific article; zbMATH DE number 1179314 (Why is no real title available?)
• scientific article; zbMATH DE number 910878 (Why is no real title available?)
• scientific article; zbMATH DE number 1414290 (Why is no real title available?)
• On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
• The String-to-String Correction Problem

Cited in

(3)

• The complexity of learning SUBSEQ(A)
• Quickest Search and Learning Over Correlated Sequences: Theory and Application
• Finding the longest common subsequence for multiple biological sequences by ant colony optimization

This page was built for publication: A learning algorithm for the longest common subsequence problem

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