A learning algorithm for the longest common subsequence problem

DOI10.1145/996546.996552zbMath1085.68616OpenAlexW1966912586MaRDI QIDQ5463438

Mark K. Goldberg, Eric A. Breimer, 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

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

Related Items (max. 100)

Finding the longest common subsequence for multiple biological sequences by ant colony optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An O(NP) sequence comparison algorithm
• An \(O(ND)\) difference algorithm and its variations
• A faster algorithm computing string edit distances
• A longest common subsequence algorithm suitable for similar text strings
• Algorithms for approximate string matching
• A theory of the learnable
• A linear space algorithm for computing maximal common subsequences
• A fast algorithm for computing longest common subsequences
• Algorithms for the Longest Common Subsequence Problem
• The String-to-String Correction Problem
• On the Approximation of Shortest Common Supersequences and Longest Common Subsequences

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