Bounding the expected length of longest common subsequences and forests

Subsumed by LSI-98-50-R

Detalhes bibliográficos
Autores: Baeza-Yates, Ricardo A, Gavaldà Mestre, Ricard|||0000-0003-4736-7179, Navarro, Gonzalo
Tipo de documento: relatório científico
Data de publicação:1996
País:España
Recursos:Universitat Politècnica de Catalunya (UPC)
Repositório:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglês
OAI Identifier:oai:upcommons.upc.edu:2117/82911
Acesso em linha:https://hdl.handle.net/2117/82911
Access Level:Acceso aberto
Palavra-chave:Longest common subsequence
LCS
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
id ES_8e867c758dcf0d1c1ae33ee43ce7d8e1
oai_identifier_str oai:upcommons.upc.edu:2117/82911
network_acronym_str ES
network_name_str España
repository_id_str
spelling Bounding the expected length of longest common subsequences and forestsBaeza-Yates, Ricardo AGavaldà Mestre, Ricard|||0000-0003-4736-7179Navarro, GonzaloLongest common subsequenceLCSÀrees temàtiques de la UPC::Informàtica::Informàtica teòricaSubsumed by LSI-98-50-RWe 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.19961996-05-0120162016-02-15reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reportapplication/postscripthttps://hdl.handle.net/2117/82911reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/829112026-05-27T15:37:01Z
dc.title.none.fl_str_mv Bounding the expected length of longest common subsequences and forests
title Bounding the expected length of longest common subsequences and forests
spellingShingle Bounding the expected length of longest common subsequences and forests
Baeza-Yates, Ricardo A
Longest common subsequence
LCS
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
title_short Bounding the expected length of longest common subsequences and forests
title_full Bounding the expected length of longest common subsequences and forests
title_fullStr Bounding the expected length of longest common subsequences and forests
title_full_unstemmed Bounding the expected length of longest common subsequences and forests
title_sort Bounding the expected length of longest common subsequences and forests
dc.creator.none.fl_str_mv Baeza-Yates, Ricardo A
Gavaldà Mestre, Ricard|||0000-0003-4736-7179
Navarro, Gonzalo
author Baeza-Yates, Ricardo A
author_facet Baeza-Yates, Ricardo A
Gavaldà Mestre, Ricard|||0000-0003-4736-7179
Navarro, Gonzalo
author_role author
author2 Gavaldà Mestre, Ricard|||0000-0003-4736-7179
Navarro, Gonzalo
author2_role author
author
dc.subject.none.fl_str_mv Longest common subsequence
LCS
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
topic Longest common subsequence
LCS
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
description Subsumed by LSI-98-50-R
publishDate 1996
dc.date.none.fl_str_mv 1996
1996-05-01
2016
2016-02-15
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/82911
url https://hdl.handle.net/2117/82911
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/postscript
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869413136241524736
score 15,228081

Registros relacionados