Computing the Number of Longest Common Subsequences

Details Computing the Number of Longest Common Subsequences Computing the Number of Longest Common Subsequences

2003-01-29

arxiv.org/abs/cs/0301034v1

Computer Science

Data Structures and Algorithms

3 pages, LaTeX

Scientific paper

This note provides very simple, efficient algorithms for computing the number
of distinct longest common subsequences of two input strings and for computing
the number of LCS embeddings.

Affiliated with

Also associated with

No associations

Rating

Computing the Number of Longest Common Subsequences 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 Computing the Number of Longest Common Subsequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing the Number of Longest Common Subsequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-335820