A data structure for substring-substring LCS length queries
From MaRDI portal
Publication:2118872
DOI10.1016/J.TCS.2022.02.004OpenAlexW4212888132MaRDI QIDQ2118872FDOQ2118872
Publication date: 23 March 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.02.004
Cites Work
- A linear-time algorithm for a special case of disjoint set union
- The String-to-String Correction Problem
- A faster algorithm computing string edit distances
- The constrained longest common subsequence problem
- On the common substring alignment problem
- A fast algorithm for computing longest common subsequences
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- On the generalized constrained longest common subsequence problems
- A simple algorithm for the constrained sequence problems
- A new efficient algorithm for computing the longest common subsequence
- Semi-local longest common subsequences in subquadratic time
- Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings
- The longest common subsequence problem revisited
- A fast algorithm for multiplying min-sum permutations
- An almost quadratic time algorithm for sparse spliced alignment
- A longest common subsequence algorithm suitable for similar text strings
- Title not available (Why is that?)
- An almost-linear time and linear space algorithm for the longest common subsequence problem
- A substring-substring LCS data structure
- Fast distance multiplication of unit-Monge matrices
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: A data structure for substring-substring LCS length queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118872)
