A Survey of Longest Common Subsequence Algorithms

Bergroth, L., Hakonen, H., & Raita, T. (2000). A Survey of Longest Common Subsequence Algorithms. Proceedings of SPIRE 2000, 39-48.

Type

Conference paper

Intellectual base

Review or monograph

Year

2000

DOI

10.1109/spire.2000.878178

Link

https://doi.org/10.1109/SPIRE.2000.878178

Cited by

1 citation across 1 artifact.

Domain-specific

• Hunt–Szymanski Algorithm
  • Storing the matched pair and a pointer to the predecessor realizing \(T[k]\) allows reverse reconstruction of one LCS.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:2f59da5fb641 · see in the full table