scientific article
From MaRDI portal
Publication:3143773
zbMath1265.68363MaRDI QIDQ3143773
Publication date: 4 December 2012
Full work available at URL: http://www.kybernetika.cz/content/2002/1/45/paper.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An O(NP) sequence comparison algorithm
- New algorithms for the LCS problem
- Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings
- The longest common subsequence problem revisited
- An \(O(ND)\) difference algorithm and its variations
- A linear space algorithm for the LCS problem
- On finding minimal length superstrings
- A faster algorithm computing string edit distances
- A longest common subsequence algorithm suitable for similar text strings
- Fast linear-space computations of longest common subsequences
- Some limit results for longest common subsequences
- A decomposition theorem for partially ordered sets
- Tree Systems for Syntactic Pattern Recognition
- Algorithms for approximate string matching
- An Extension of the String-to-String Correction Problem
- A linear space algorithm for computing maximal common subsequences
- Longest common subsequences of two random sequences
- Bounds for the String Editing Problem
- Bounds on the Complexity of the Longest Common Subsequence Problem
- A fast algorithm for computing longest common subsequences
- The Complexity of Some Problems on Subsequences and Supersequences
- A Sentence-to-Sentence Clustering Procedure for Pattern Analysis
- Algorithms for the Longest Common Subsequence Problem
- The String-to-String Correction Problem
This page was built for publication:
