We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
On the Constrained Longest Common Subsequence Problem.
- Authors
Gorbenko, Anna
- Abstract
The problem of the longest common subsequence is a classical distance measure for strings. There have been several attempts to accommodate longest common subsequences along with some other distance measures. There are a large number of different variants of the problem. In this paper, we consider the constrained longest common subsequence problem for two strings and arbitrary number of constraints. In particular, we consider an explicit reduction from the problem to the satisfiability problem and present experimental results for different satisfiability algorithms. It should be noted that different regularities in experimentally obtained data reveal important information about the underlying physical system. In this paper, we consider the problem of systematic monitoring of passenger flows. In particular, we use constrained longest common subsequences for tracking the image features.
- Subjects
CONSTRAINT programming; GENETIC algorithms; SATISFIABILITY (Computer science); COMPUTER algorithms; STATISTICS; MATHEMATICAL analysis; COMPUTER science
- Publication
IAENG International Journal of Computer Science, 2013, Vol 40, Issue 4, p266
- ISSN
1819-656X
- Publication type
Article