# An Efficient Dynamic Programming Algorithm for STR-IC-STR-IC-LCS Problem

@inproceedings{Zhu2015AnED, title={An Efficient Dynamic Programming Algorithm for STR-IC-STR-IC-LCS Problem}, author={Daxin Zhu and Yingjie Wu and Xiaodong Wang}, booktitle={Pacific-Asia Conference on Knowledge Discovery and Data Mining}, year={2015} }

In this paper, we consider a generalized longest common subsequence problem, in which a constraining sequence of length s must be included as a substring and the other constraining sequence of length t must be included as a subsequence of two main sequences and the length of the result must be maximal. For the two input sequences X and Y of lengths n and m, and the given two constraining sequences of length s and t, we present an Onmst time dynamic programming algorithm for solving the new…

## 4 Citations

### A hardness result and new algorithm for the longest common palindromic subsequence problem

- Computer ScienceInf. Process. Lett.
- 2018

### Computing longest common square subsequences

- Computer Science, MathematicsCPM
- 2018

The longest common square subsequence (LCSqS) problem is to compute a longest square occurring as a subsequence in two given strings A and B and it is shown that the problem can easily be solved in O(n^6) time or O(|M|n^4) time with O(sigma) space, where n is the length of the strings and M is the set of matching points between A and A.

### Improving transport of elderly and people with disabilities in Drenthe

- Economics
- 2017

This thesis is centred on the transportation system for elderly and people with disabilities in the southeast area Drenthe, The Netherlands. Since the beginning of 2014, the municipalities of…

### Design of Intelligent Manufacturing Big Data Cloud Service Platform

- Business
- 2018

With the coming of the intelligent manufacturing, the technology and application of industrial big data will be popular in the future. The productivity, competitiveness and innovation of the…

## References

SHOWING 1-10 OF 11 REFERENCES

### Quadratic-time algorithm for a string constrained LCS problem

- Computer ScienceInf. Process. Lett.
- 2012

### Efficient Algorithms for the Longest Common Subsequence Problem with Sequential Substring Constraints

- Computer Science, Mathematics2011 IEEE 11th International Conference on Bioinformatics and Bioengineering
- 2011

### Constrained Longest Common Subsequence Computing Algorithms in Practice

- Computer ScienceComput. Informatics
- 2010

An improvement to the algorithms by Chin et al. and Deorowicz based on an entry-exit points technique by He and Arslan is proposed and experimentally the existing algorithms for solving the CLCS problem are compared.

### On the generalized constrained longest common subsequence problems

- Mathematics, Computer ScienceJ. Comb. Optim.
- 2011

Four variants of the longest common subsequence problem are investigated and a new dynamic programming algorithms for solving the GC-LCS problems in O(mnρ) time are proposed.

### Constrained LCS: Hardness and Approximation

- Computer ScienceCPM
- 2008

A linear time approximation algorithm is proposed that yields a $1 / \sqrt{m_{min}|\Sigma|}$ approximation factor, where m min is the length of the shortest input string and |Σ| is the size of the alphabet.

### An Algorithm and Applications to Sequence Alignment with Weighted Constraints

- Computer ScienceInt. J. Found. Comput. Sci.
- 2010

This paper gives an O(rnm)-time algorithm for solving the weighted constrained pairwise sequence alignment problem, and shows that the extension can be adopted to solve some constraint-related problems that cannot be solved by previous algorithms for the constrained longest common subsequence problem or the constrained Pairwise Sequence alignment problem.

### Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology

- Computer Science
- 1997

The author examines the importance of (sub)sequence comparison in molecular biology, core string edits, alignments and dynamic programming, and a deeper look at classical methods for exact string matching.

### Constrained multiple sequence alignment tool development and its application to RNase family alignment

- Computer Science, BiologyProceedings. IEEE Computer Society Bioinformatics Conference
- 2002

An algorithm of computing a constrained multiple sequence alignment (CMSA) for guaranteeing that the generated alignment satisfies the user-specified constraints that some particular residues should be aligned together is designed.

### Algorithms on strings

- Computer Science
- 2007

Describing algorithms in a C-like language, this text presents examples related to the automatic processing of natural language, to the analysis of molecular sequences and to the management of…