To access the full text documents, please follow this link: http://hdl.handle.net/2117/87415
dc.contributor | Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics |
---|---|
dc.contributor.author | Blum, Christian |
dc.contributor.author | Cotta, C. |
dc.contributor.author | Fernández, Antonio J. |
dc.contributor.author | Gallardo, Francisco |
dc.date | 2006-11 |
dc.identifier.citation | Blum, C., Cotta, C., Fernández, A., Gallardo, F. "A probabilistic beam search approach to the shortest common supersequence problem". 2006. |
dc.identifier.uri | http://hdl.handle.net/2117/87415 |
dc.language.iso | eng |
dc.relation | LSI-06-36-R |
dc.rights | info:eu-repo/semantics/openAccess |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
dc.subject | Combinatorial mathematics |
dc.subject | Greedy algorithms |
dc.subject | Optimisation |
dc.subject | Probability |
dc.subject | Search problems |
dc.subject | String matching |
dc.title | A probabilistic beam search approach to the shortest common supersequence problem |
dc.type | info:eu-repo/semantics/publishedVersion |
dc.type | info:eu-repo/semantics/report |
dc.description.abstract |