Semi-local string comparison: algorithmic techniques and applications

Details Semi-local string comparison: algorithmic techniques and applications Semi-local string comparison: algorithmic techniques and applications

2007-07-24

arxiv.org/abs/0707.3619v17

Computer Science

Data Structures and Algorithms

Scientific paper

The longest common subsequence (LCS) problem is a classical problem in computer science. The semi-local LCS problem is a generalisation of the LCS problem, arising naturally in the context of string comparison. In this work, we present a number of algorithmic techniques related to the semi-local LCS problem, and give a number of algorithmic applications of these techniques. Summarising the presented results, we conclude that semi-local string comparison turns out to be a useful algorithmic plug-in, which unifies, and often improves on, a number of previous approaches to various substring- and subsequence-related problems.

Affiliated with

Also associated with

No associations

Rating

Semi-local string comparison: algorithmic techniques and applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Semi-local string comparison: algorithmic techniques and applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Semi-local string comparison: algorithmic techniques and applications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-440932