Abstract
We present an efficient algorithm for finding the longest common subsequence of two sequences in cases where the starting points of the sequences are not known. In addition, we differentiate between cases when there can or cannot be assumptions regarding the clustering of the subsequences.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Discrete mathematics, algorithms, and applications
Paper Title
Journal
Date
