Computing the Number of Longest Common Subsequences

Simple item page
dc.creatorGreenberg, Ronald I.
dc.date2003-01-29
dc.date.accessioned2026-07-07T03:19:24Z
dc.date.available2026-07-07T03:19:24Z
dc.descriptionThis note provides very simple, efficient algorithms for computing the number of distinct longest common subsequences of two input strings and for computing the number of LCS embeddings.
dc.description3 pages, LaTeX
dc.identifierhttps://arxiv.org/abs/cs/0301034
dc.identifierhttp://arxiv.org/abs/cs/0301034
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31446
dc.subjectData Structures and Algorithms
dc.subjectDiscrete Mathematics
dc.subjectF.2.2; G.2.1
dc.titleComputing the Number of Longest Common Subsequences
dc.typetext

Files

Collections

arXiv