scientific article; zbMATH DE number 30301
From MaRDI portal
Publication:3985349
Cited in
(7)- A data structure for substring-substring LCS length queries
- A new practical linear space algorithm for the longest common subsequence problem
- Fast Algorithms for Computing Tree LCS
- Longest common subsequences
- Efficient algorithms for enumerating maximal common subsequences of two strings
- The longest common subsequence problem for small alphabets in the word RAM model
- Fast algorithms for computing tree LCS
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 Q3985349)