Computing longest common square subsequences
From MaRDI portal
Publication:5140779
DOI10.4230/LIPICS.CPM.2018.15zbMATH Open1497.68604MaRDI QIDQ5140779FDOQ5140779
Authors: Takafumi Inoue, Shunsuke Inenaga, Heikki Hyyrö, Hideo Bannai, Masayuki Takeda 
Publication date: 16 December 2020
Recommendations
Cites Work
- The String-to-String Correction Problem
- A faster algorithm computing string edit distances
- Incremental String Comparison
- Fast and compact regular expression matching
- New tabulation and sparse dynamic programming based techniques for sequence similarity problems
- A simple algorithm for the constrained sequence problems
- A new efficient algorithm for computing the longest common subsequence
- Regular expression constrained sequence alignment
- New efficient algorithms for the LCS and constrained LCS problems
- All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
- Quadratic-time algorithm for a string constrained LCS problem
- Doubly-constrained LCS and hybrid-constrained LCS problems revisited
- An almost quadratic time algorithm for sparse spliced alignment
- Dynamic edit distance table under a general weighted cost function
- A dynamic edit distance table
- Constrained sequence analysis algorithms in computational biology
- On finding a longest common palindromic subsequence
- Computing a longest common palindromic subsequence
- A simple algorithm for solving for the generalized longest common subsequence (LCS) problem with a substring exclusion constraint
- A hardness result and new algorithm for the longest common palindromic subsequence problem
- String Processing and Information Retrieval
- Faster STR-IC-LCS computation via RLE
Cited In (13)
- Longest property-preserved common factor
- Longest bordered and periodic subsequences
- An efficient algorithm for the longest common palindromic subsequence problem
- Longest Square Subsequence Problem Revisited
- Longest common rollercoasters
- Longest property-preserved common factor: a new string-processing framework
- Computing a Longest Common Palindromic Subsequence
- A neural network based guidance for a BRKGA: an application to the longest common square subsequence problem
- Computing the least common subsumer w.r.t. a background terminology
- On longest common property preserved substring queries
- Online algorithms on antipowers and antiperiods
- Computing longest Lyndon subsequences and longest common Lyndon subsequences
- Algorithms and hardness for the longest common subsequence of three strings and related problems
This page was built for publication: Computing longest common square subsequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140779)
