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

Pages

39-48

DOI

10.1109/spire.2000.878178

DOI registrant

Institute of Electrical and Electronics Engineers

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

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

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