Mostra el registre d'ítem simple
Bounding the expected length of longest common subsequences and forests
dc.contributor.author | Baeza-Yates, Ricardo A |
dc.contributor.author | Gavaldà Mestre, Ricard |
dc.contributor.author | Navarro, Gonzalo |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2016-02-15T10:17:34Z |
dc.date.available | 2016-02-15T10:17:34Z |
dc.date.issued | 1996-05 |
dc.identifier.citation | Baeza-Yates, R., Gavaldà, R., Navarro, G. "Bounding the expected length of longest common subsequences and forests". 1996. |
dc.identifier.uri | http://hdl.handle.net/2117/82911 |
dc.description.abstract | Subsumed by LSI-98-50-R |
dc.description.abstract | We 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.extent | 15 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
dc.subject.other | Longest common subsequence |
dc.subject.other | LCS |
dc.title | Bounding the expected length of longest common subsequences and forests |
dc.type | External research report |
dc.rights.access | Open Access |
local.identifier.drac | 1893804 |
dc.description.version | Postprint (published version) |
local.citation.author | Baeza-Yates, R.; Gavaldà, R.; Navarro, G. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [1.107]