Skip to main content
SpringerLink
Log in
Book cover

International Conference on Computing and Information

ICCI 1990: Advances in Computing and Information — ICCI '90 pp 385–394Cite as

Parallel computation of Longest-Common-Subsequence

  • Computer Architecture, Concurrency, Parallelism, Communication And Networking
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 468))

Abstract

A parallel algorithm for finding the longest common subsequence of two strings is presented. Our algorithm is executed on r processors, with r equal to the total number of pairs of positions at which two symbols match. Given two strings of length m and n respectively, m <- n, with preprocessing allowed, our algorithm achieves O(logρlog2 n) time complexity where ρ is the longest common subsequence. Fast computing of Longest-Common-Subsequence is made possible due to the exploiting of the parallelism.

This research is partially supported by the National Science Foundation under Grant No. MIP-8809328.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Sankoff and J. B. Kruskal, editors, Time warps, string edits, and macromolecules: the theory and practice of sequence comparison, Reading, MA: The MIT Press, 1985.

    Google Scholar 

  2. J. L. Modelevsky, “Computer applications in applied genetic engineering,” Advances in Applied Microbiology Vol. 30, 1984, pp. 169–195.

    Google Scholar 

  3. Y. Chiang and K. S. Fu, “Parallel processing for distance computation in syntactic pattern recognition,” Proceedings of IEEE Computer Society Workshop on Computer Architecture for Pattern Analysis and Image Database Management, Nov. 1981.

    Google Scholar 

  4. D. S. Hirschberg, “A linear space algorithm for computing maximal common subsequences,” Communications of the ACM, Vol. 18, No. 6, June 1975, pp. 341–343.

    Google Scholar 

  5. A. V. Aho, D. S. Hirschberg and J. D. Ullman, “Bounds on the complexity of the maximal common subsequence problem,” Proceedings of 15th Annual IEEE Symposium on Switching and Automata Theory, 1974, pp. 104–109.

    Google Scholar 

  6. D. S. Hirschberg, “Algorithms for the longest common subsequence problem,” Journal of the ACM, Vol. 24, no. 4, Oct. 1977, pp. 664–675.

    Google Scholar 

  7. W. J. Hsu and M. W. Du, “New algorithms for the LCS problem,” Journal of Computer and System Sciences, 29, 1984, pp. 133–152.

    Google Scholar 

  8. W. J. Hsu and M. W. Du, “Computing a longest common subsequence for a set of strings,” Bit, 24, 1984, pp. 45–59.

    Google Scholar 

  9. D. P. Lopresti and R. Hughey, “The B-SYS programmable systolic array”, Technical Report CS-89-32, Department of Computer Science, Brown University, Providence, June 1989.

    Google Scholar 

  10. P. A. Wagner and M. J. Fischer, “The string-to-string correction problem,” Journal of ACM, 21 (1), 1974, pp. 168–173.

    Google Scholar 

  11. R. Cole, “Parallel Merge Sort,” SIAM J. on Comp., Vol. 17, No. 4, Aug. 1988, pp. 770–785.

    Google Scholar 

  12. A. Gibbons and W. Rytter, “Efficient Parallel Algorithms”, Cambridge University Press, Campbridge, 1988, pp. 13–18.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Electrical Engineering Department, Texas A&M University, 77843, College Station, TX

    Mi Lu

Authors
  1. Mi Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

S. G. Akl F. Fiala W. W. Koczkodaj

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lu, M. (1991). Parallel computation of Longest-Common-Subsequence. In: Akl, S.G., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '90. ICCI 1990. Lecture Notes in Computer Science, vol 468. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53504-7_96

Download citation

  • DOI: https://doi.org/10.1007/3-540-53504-7_96

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53504-1

  • Online ISBN: 978-3-540-46677-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation