Skip to main content
SpringerLink
Log in

Efficient Computation of All Longest Common Subsequences

  • Conference paper
  • First Online:
Algorithm Theory - SWAT 2000 (SWAT 2000)

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

Included in the following conference series:

Abstract

Many efficient algorithms have been developed to compute the length of a longest common subsequence (LCS) between two strings. In general, an LCS is not unique but current methods only recover a single LCS. We investigate the problem of finding all longest common subsequences. A simple extension of the reconstruction method used by existing algorithms would seriously harm their time complexities. We present observations on a symmetry of the LCS problem which allow us to develop a general method to obtain a representation of all longest common subsequences while preserving the favorable time bounds of known algorithms.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Apostolico and C. Guerra. The longest common subsequence problem revisited. Algorithmica, 2:315–336, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  2. R. A. Baeza-Yates. Searching subsequences. Theoretical Computer Science, 78(2):363–376, January 1991.

    Article  MATH  MathSciNet  Google Scholar 

  3. L. Bergroth, H. Hakonen, and T. Raita. A survey of longest common subsequence algorithms (extended abstract). Technical report, Dept. of Computer Science, University of Turku, Finland, April 2000. manuscript.

    Google Scholar 

  4. N. Blum. Speeding up dynamic programming without omitting any optimal solution and some applications in molecular biology. Journal of Algorithms, to appear, 2000.

    Google Scholar 

  5. E. Breimer, M. Goldberg, and D. Lim. A learning algorithm for the longest common subsequence problem. In Proceedings of the 2nd Algorithm Engineering and Experiments, pages 147–156, San Francisco, CA, 2000.

    Google Scholar 

  6. Francis Y. L. Chin and C. K. Poon. A fast algorithm for computing longest common subsequences of small alphabet size. Journal of Information Processing., 13(4):463–469, 1990.

    MATH  Google Scholar 

  7. David Eppstein, Zvi Galil, Raffaele Giancarlo, and Giuseppe F. Italiano. Sparse dynamic programming I: Linear cost functions. Journal of the ACM, 39(3):519–545, July 1992.

    Article  MATH  MathSciNet  Google Scholar 

  8. D. S. Hirschberg. A linear space algorithm for computing maximal common subsequences. Communications of the ACM, 18(6):341–343, June 1975.

    Article  MATH  MathSciNet  Google Scholar 

  9. D. S. Hirschberg. Algorithms for the longest common subsequence problem. Jrnl. A.C.M., 24(4):664–675, 1977.

    MATH  MathSciNet  Google Scholar 

  10. D. S. Hirschberg. Serial computations of Levenshtein distances. In A Postolico and Z. Galil, editors, Pattern matching algorithms, chapter 4, pages 123–141. Oxford University Press, 1997.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  12. James W. Hunt and Thomas G. Szymanski. A fast algorithm for computing longest common subsequences. Communications of the ACM, 20(5):350–353, May 1977.

    Article  MATH  MathSciNet  Google Scholar 

  13. N. Nakatsu, Y. Kambayashi, and S. Yajima. A longest common subsequence algorithm suitable for similar text strings. Acta Informatica, 18:171–179, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  14. Claus Rick. A new flexible algorithm for the longest common subsequence problem. Nordic Journal of Computing, 2(4):444–461, Winter 1995.

    MATH  MathSciNet  Google Scholar 

  15. Claus Rick. A new flexible algorithm for the longest common subsequence problem. In Zvi Galil and Esko Ukkonen, editors, Combinatorial Pattern Matching, 6th Annual Symposium, volume 937 of Lecture Notes in Computer Science, pages 340–351, Espoo, Finland, 5–7 July 1995. Springer.

    Google Scholar 

  16. Claus Rick. Simple and fast linear space computation of longest common subsequences, submitted for publication, 2000.

    Google Scholar 

  17. Robert A. Wagner and Michael J. Fischer. The string-to-string correction problem. Journal of the ACM, 21(1):168–173, January 1974.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik IV, Universität Bonn, Römerstr. 164, 53117, Bonn, Germany

    Claus Rick

Authors
  1. Claus Rick
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rick, C. (2000). Efficient Computation of All Longest Common Subsequences. In: Algorithm Theory - SWAT 2000. SWAT 2000. Lecture Notes in Computer Science, vol 1851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44985-X_35

Download citation

  • DOI: https://doi.org/10.1007/3-540-44985-X_35

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67690-4

  • Online ISBN: 978-3-540-44985-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation