Mostra el registre d'ítem simple

Bounding the expected length of longest common subsequences and forests

dc.contributor.authorBaeza-Yates, Ricardo A
dc.contributor.authorGavaldà Mestre, Ricard
dc.contributor.authorNavarro, Gonzalo
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2016-02-15T10:17:34Z
dc.date.available2016-02-15T10:17:34Z
dc.date.issued1996-05
dc.identifier.citationBaeza-Yates, R., Gavaldà, R., Navarro, G. "Bounding the expected length of longest common subsequences and forests". 1996.
dc.identifier.urihttp://hdl.handle.net/2117/82911
dc.description.abstractSubsumed by LSI-98-50-R
dc.description.abstractWe present two techniques to find upper and lower bounds for the expected length of longest common subsequences of forests of two random sequences of the same lenght, over a fixed size, uniformly distributed alphabet. We emphasize the power of the methods used, which are Markov chains and Kolmogorov complexity. As a corollary we obtain new lower and upper bounds for the problems mentioned.
dc.format.extent15 p.
dc.language.isoeng
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.otherLongest common subsequence
dc.subject.otherLCS
dc.titleBounding the expected length of longest common subsequences and forests
dc.typeExternal research report
dc.rights.accessOpen Access
local.identifier.drac1893804
dc.description.versionPostprint (published version)
local.citation.authorBaeza-Yates, R.; Gavaldà, R.; Navarro, G.


Fitxers d'aquest items

Thumbnail
Nom:
R96-29.ps
Mida:
167,2Kb
Format:
Postscript
Visualitza/Obre

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple