On the Longest Common Parameterized Subsequence

DOI10.1007/978-3-540-69068-9_28MaRDI QIDQ3506962zbMATH OpenOpenAlexFDO

Authors Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein

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-69068-9_28

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Recommendations

• On the longest common parameterized subsequence
• scientific article; zbMATH DE number 6161102
• Algorithms for Computing the Longest Parameterized Common Subsequence
• Lower Bounds and Parameterized Approach for Longest Common Subsequence
• scientific article; zbMATH DE number 6161488
• Longest common subsequence in sublinear space
• On the parameterized complexity of the repetition free longest common subsequence problem
• The longest common subsequence problem revisited
• Combinatorial Pattern Matching
• On the longest common rigid subsequence problem

Cites work

• A fast algorithm for computing longest common subsequences
• A faster algorithm computing string edit distances
• A longest common subsequence algorithm suitable for similar text strings
• Alphabet dependence in parameterized matching
• An \(O(ND)\) difference algorithm and its variations
• Approximate parameterized matching
• Combinatorial Pattern Matching
• Faster suffix tree construction with missing suffix links
• scientific article; zbMATH DE number 1305486 (Why is no real title available?)
• scientific article; zbMATH DE number 1306895 (Why is no real title available?)
• scientific article; zbMATH DE number 910912 (Why is no real title available?)
• scientific article; zbMATH DE number 3240929 (Why is no real title available?)
• On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
• Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
• Parameterized pattern matching: Algorithms and applications
• Reducibility among combinatorial problems
• The Complexity of Some Problems on Subsequences and Supersequences
• The string B-tree
• The String-to-String Correction Problem

Cited in

(19)

• Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence
• On the longest common parameterized subsequence
• The parameterized complexity of sequence alignment and consensus
• On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
• Longest common substring for random subshifts of finite type
• Sparse long blocks and the micro-structure of the longuest common subsequences
• Parameterized Complexity and Approximability of the SLCS Problem
• Algorithms for Computing the Longest Parameterized Common Subsequence
• Lower Bounds and Parameterized Approach for Longest Common Subsequence
• On the parameterized complexity of the repetition free longest common subsequence problem
• The set of parameterized k-covers problem
• Parameterized complexity and approximability of the longest compatible sequence problem
• On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
• The longest filled common subsequence problem
• On longest matching consecutive subsequence
• Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs
• scientific article; zbMATH DE number 7651110 (Why is no real title available?)
• Cyclic longest common subsequence
• Longest common subsequence problem for unoriented and cyclic strings

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

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