Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion
type: Item
instance of: scholarly article
title: Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion
zbMATH Open document ID: 1314.90066
author: Hsing-Yen Ann
author: Chang-Biau Yang
author: Chiou-Ting Tseng
published in: Journal of Combinatorial Optimization
publication date: 2015-01-21T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6388499
zbMATH Keywords: design of algorithms
zbMATH Keywords: longest common subsequence
zbMATH Keywords: constrained LCS
zbMATH Keywords: NP-hard
zbMATH Keywords: finite automata
MaRDI profile type: Publication
full work available at URL: s10878-012-9588-2
OpenAlex ID: W2168333158
cites work: Efficient string matching
cites work: A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings
cites work: Efficient algorithms for the block edit problems
cites work: Fast algorithms for computing the constrained LCS of run-length encoded strings
cites work: The longest common subsequence problem revisited
cites work: ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS
cites work: Beam search for the longest common subsequence problem
cites work: On the generalized constrained longest common subsequence problems
cites work: A simple algorithm for the constrained sequence problems
cites work: Q3619797
cites work: Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem
cites work: Quadratic-time algorithm for a string constrained LCS problem
cites work: Q2970219
cites work: Dynamic Perfect Hashing: Upper and Lower Bounds
cites work: Constrained LCS: Hardness and Approximation
cites work: Algorithms for the Longest Common Subsequence Problem
cites work: A fast algorithm for computing longest common subsequences
cites work: New efficient algorithms for the LCS and constrained LCS problems
cites work: A new efficient algorithm for computing the longest common subsequence
cites work: Q3565916
cites work: Finite automata based algorithms on subsequences and supersequences of degenerate strings
cites work: Fast Pattern Matching in Strings
cites work: The Complexity of Some Problems on Subsequences and Supersequences
cites work: AN ALGORITHM AND APPLICATIONS TO SEQUENCE ALIGNMENT WITH WEIGHTED CONSTRAINTS
cites work: Finding the longest common subsequence for multiple biological sequences by ant colony optimization
cites work: The constrained longest common subsequence problem
cites work: Efficient algorithms for the longest common subsequence problem with sequential substring constraints
cites work: The String-to-String Correction Problem
DOI: 10.1007/S10878-012-9588-2
description: scientific article; zbMATH DE number 6388499