Algorithms for Computing the Longest Parameterized Common Subsequence

DOI10.1007/978-3-540-73437-6_27MaRDI QIDQ3506928zbMATH OpenOpenAlexFDO

Authors Costas S. Iliopoulos, M. Sohel Rahman, Marcin Kubica, Tomasz Waleń

Publication date 17 June 2008

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73437-6_27

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Nonnumerical algorithms (68W05)

Recommendations

• On the Longest Common Parameterized Subsequence
• On the longest common parameterized subsequence
• Algorithms for Computing Variants of the Longest Common Subsequence Problem
• Lower Bounds and Parameterized Approach for Longest Common Subsequence
• On the parameterized complexity of the repetition free longest common subsequence problem

Cited in

(26)

• Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence
• On the longest common parameterized subsequence
• Efficient algorithms for the longest common subsequence problem with sequential substring constraints
• Computing the longest common almost-increasing subsequence
• Finding the gapped longest common subsequence by incremental suffix maximum queries
• Efficient algorithms for the longest common subsequence in \(k\)-length substrings
• Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence
• A brief history of parameterized matching problems
• Anytime algorithms for the longest common palindromic subsequence problem
• Weighted approximate parameterized string matching
• A hardness result and new algorithm for the longest common palindromic subsequence problem
• A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem
• Hardness and approximation of multiple sequence alignment with column score
• scientific article; zbMATH DE number 6697960 (Why is no real title available?)
• On the Longest Common Parameterized Subsequence
• Lower Bounds and Parameterized Approach for Longest Common Subsequence
• scientific article; zbMATH DE number 5545474 (Why is no real title available?)
• On the parameterized complexity of the repetition free longest common subsequence problem
• Parameterized complexity and approximability of the longest compatible sequence problem
• Sketching, streaming, and fine-grained complexity of (weighted) LCS
• A learning algorithm for the longest common subsequence problem
• Longest Common Subsequence with Gap Constraints
• A Scalable Approximation Algorithm for Weighted Longest Common Subsequence
• Subsequences with generalised gap constraints: upper and lower complexity bounds
• Longest common subsequence with gap constraints
• Dynamic programming algorithms for the mosaic longest common subsequence problem

This page was built for publication: Algorithms for Computing the Longest Parameterized Common Subsequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3506928)