Aliya Farheen

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The longest common subsequence (LCS) problem is a classical problem in computer science, and forms the basis of the current best-performing reference-based compression schemes for genome resequencing data. First, we present a new algorithm for the LCS problem. Using the generalized suffix tree, we identify the common substrings shared between the two input(More)
  • 1