Slide suffix tree construction algorithm

The suffix tree is the most powerful and versatile structure in the string matching. For this structure, the classical construction algorithms in linear time are the Weiner, the McCreight and the Ukkonen algorithm. In this work is presented a review of these construction algorithms and a new one tha...

Descripción completa

Detalles Bibliográficos
Autor: Huerta, Mario
Tipo de recurso: informe técnico
Fecha de publicación:2002
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/97412
Acceso en línea:https://hdl.handle.net/2117/97412
Access Level:acceso abierto
Palabra clave:Suffix tree construction algorithm
String matching
Àrees temàtiques de la UPC::Informàtica::Aplicacions de la informàtica
id ES_7a4d37be39c9675d3601ccbb73fdb746
oai_identifier_str oai:upcommons.upc.edu:2117/97412
network_acronym_str ES
network_name_str España
repository_id_str
spelling Slide suffix tree construction algorithmHuerta, MarioSuffix tree construction algorithmString matchingÀrees temàtiques de la UPC::Informàtica::Aplicacions de la informàticaThe suffix tree is the most powerful and versatile structure in the string matching. For this structure, the classical construction algorithms in linear time are the Weiner, the McCreight and the Ukkonen algorithm. In this work is presented a review of these construction algorithms and a new one that improves two non functional characteristics: efficiency and usability . This new algorithm reduces the construction time in about 50% (experimentally tested) , the query time and space spent allowing to work with much longer sequences. In this way, the algorithm uses a new design of suffix links structure that provides a major locality between the subtrees (a profit example will be shown). Further more, the resultant algorithm are much more understandable, making it specially easy to modify for resolve concrete problems.20022002-10-0920162016-11-29reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reportapplication/pdfhttps://hdl.handle.net/2117/97412reponame: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/974122026-05-27T15:37:01Z
dc.title.none.fl_str_mv Slide suffix tree construction algorithm
title Slide suffix tree construction algorithm
spellingShingle Slide suffix tree construction algorithm
Huerta, Mario
Suffix tree construction algorithm
String matching
Àrees temàtiques de la UPC::Informàtica::Aplicacions de la informàtica
title_short Slide suffix tree construction algorithm
title_full Slide suffix tree construction algorithm
title_fullStr Slide suffix tree construction algorithm
title_full_unstemmed Slide suffix tree construction algorithm
title_sort Slide suffix tree construction algorithm
dc.creator.none.fl_str_mv Huerta, Mario
author Huerta, Mario
author_facet Huerta, Mario
author_role author
dc.subject.none.fl_str_mv Suffix tree construction algorithm
String matching
Àrees temàtiques de la UPC::Informàtica::Aplicacions de la informàtica
topic Suffix tree construction algorithm
String matching
Àrees temàtiques de la UPC::Informàtica::Aplicacions de la informàtica
description The suffix tree is the most powerful and versatile structure in the string matching. For this structure, the classical construction algorithms in linear time are the Weiner, the McCreight and the Ukkonen algorithm. In this work is presented a review of these construction algorithms and a new one that improves two non functional characteristics: efficiency and usability . This new algorithm reduces the construction time in about 50% (experimentally tested) , the query time and space spent allowing to work with much longer sequences. In this way, the algorithm uses a new design of suffix links structure that provides a major locality between the subtrees (a profit example will be shown). Further more, the resultant algorithm are much more understandable, making it specially easy to modify for resolve concrete problems.
publishDate 2002
dc.date.none.fl_str_mv 2002
2002-10-09
2016
2016-11-29
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/97412
url https://hdl.handle.net/2117/97412
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/pdf
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_ 1869411427856416768
score 15,300719

Similares en LA Referencia