BuST-Bundled Suffix Trees
- Autores
- Bortolussi, Luca; Fabris, Franceso; Policriti, Alberto
- Año de publicación
- 2006
- Idioma
- inglés
- Tipo de recurso
- documento de conferencia
- Estado
- versión publicada
- Descripción
- We introduce a data structure, the Bundled Suffix Tree (BuST), that is a generalization of a Suffix Tree (ST). To build a BuST we use an alphabet Σ together with a non-transitive relation ≈ among its letters. Following the path of a substring β within a BuST, constructed over a text α of length n, not only the positions of the exact occurrences of β in α are found (as in a ST), but also the positions of all the substrings β 1 , β 2 , β 3 , . . . that are related with β via the relation ≈ among the characters of Σ , for example strings at a certain ”distance” from β . A BuST contains O(n1+δ ) additional nodes (δ < 1) in probability, and is constructed in O(n1+δ ) steps. In the worst case it contains O(n2) nodes.
4th IFIP International Conference on Theoretical Computer Science
Red de Universidades con Carreras en Informática (RedUNCI) - Materia
-
Ciencias Informáticas
data structure
linear time - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
.jpg)
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/24377
Ver los metadatos del registro completo
| id |
SEDICI_eb7414ac8c08c75873a094ec8925d88a |
|---|---|
| oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/24377 |
| network_acronym_str |
SEDICI |
| repository_id_str |
1329 |
| network_name_str |
SEDICI (UNLP) |
| spelling |
BuST-Bundled Suffix TreesBortolussi, LucaFabris, FrancesoPolicriti, AlbertoCiencias Informáticasdata structurelinear timeWe introduce a data structure, the Bundled Suffix Tree (BuST), that is a generalization of a Suffix Tree (ST). To build a BuST we use an alphabet Σ together with a non-transitive relation ≈ among its letters. Following the path of a substring β within a BuST, constructed over a text α of length n, not only the positions of the exact occurrences of β in α are found (as in a ST), but also the positions of all the substrings β<sub> 1</sub> , β <sub>2</sub> , β<sub> 3</sub> , . . . that are related with β via the relation ≈ among the characters of Σ , for example strings at a certain ”distance” from β . A BuST contains O(n<sup>1+δ</sup> ) additional nodes (δ < 1) in probability, and is constructed in O(n<sup>1+δ</sup> ) steps. In the worst case it contains O(n<sup>2</sup>) nodes.4th IFIP International Conference on Theoretical Computer ScienceRed de Universidades con Carreras en Informática (RedUNCI)2006-08info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/24377enginfo:eu-repo/semantics/altIdentifier/isbn/0-387-34633-3info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T10:55:50Zoai:sedici.unlp.edu.ar:10915/24377Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 10:55:50.371SEDICI (UNLP) - Universidad Nacional de La Platafalse |
| dc.title.none.fl_str_mv |
BuST-Bundled Suffix Trees |
| title |
BuST-Bundled Suffix Trees |
| spellingShingle |
BuST-Bundled Suffix Trees Bortolussi, Luca Ciencias Informáticas data structure linear time |
| title_short |
BuST-Bundled Suffix Trees |
| title_full |
BuST-Bundled Suffix Trees |
| title_fullStr |
BuST-Bundled Suffix Trees |
| title_full_unstemmed |
BuST-Bundled Suffix Trees |
| title_sort |
BuST-Bundled Suffix Trees |
| dc.creator.none.fl_str_mv |
Bortolussi, Luca Fabris, Franceso Policriti, Alberto |
| author |
Bortolussi, Luca |
| author_facet |
Bortolussi, Luca Fabris, Franceso Policriti, Alberto |
| author_role |
author |
| author2 |
Fabris, Franceso Policriti, Alberto |
| author2_role |
author author |
| dc.subject.none.fl_str_mv |
Ciencias Informáticas data structure linear time |
| topic |
Ciencias Informáticas data structure linear time |
| dc.description.none.fl_txt_mv |
We introduce a data structure, the Bundled Suffix Tree (BuST), that is a generalization of a Suffix Tree (ST). To build a BuST we use an alphabet Σ together with a non-transitive relation ≈ among its letters. Following the path of a substring β within a BuST, constructed over a text α of length n, not only the positions of the exact occurrences of β in α are found (as in a ST), but also the positions of all the substrings β<sub> 1</sub> , β <sub>2</sub> , β<sub> 3</sub> , . . . that are related with β via the relation ≈ among the characters of Σ , for example strings at a certain ”distance” from β . A BuST contains O(n<sup>1+δ</sup> ) additional nodes (δ < 1) in probability, and is constructed in O(n<sup>1+δ</sup> ) steps. In the worst case it contains O(n<sup>2</sup>) nodes. 4th IFIP International Conference on Theoretical Computer Science Red de Universidades con Carreras en Informática (RedUNCI) |
| description |
We introduce a data structure, the Bundled Suffix Tree (BuST), that is a generalization of a Suffix Tree (ST). To build a BuST we use an alphabet Σ together with a non-transitive relation ≈ among its letters. Following the path of a substring β within a BuST, constructed over a text α of length n, not only the positions of the exact occurrences of β in α are found (as in a ST), but also the positions of all the substrings β<sub> 1</sub> , β <sub>2</sub> , β<sub> 3</sub> , . . . that are related with β via the relation ≈ among the characters of Σ , for example strings at a certain ”distance” from β . A BuST contains O(n<sup>1+δ</sup> ) additional nodes (δ < 1) in probability, and is constructed in O(n<sup>1+δ</sup> ) steps. In the worst case it contains O(n<sup>2</sup>) nodes. |
| publishDate |
2006 |
| dc.date.none.fl_str_mv |
2006-08 |
| dc.type.none.fl_str_mv |
info:eu-repo/semantics/conferenceObject info:eu-repo/semantics/publishedVersion Objeto de conferencia http://purl.org/coar/resource_type/c_5794 info:ar-repo/semantics/documentoDeConferencia |
| format |
conferenceObject |
| status_str |
publishedVersion |
| dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/24377 |
| url |
http://sedici.unlp.edu.ar/handle/10915/24377 |
| dc.language.none.fl_str_mv |
eng |
| language |
eng |
| dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/isbn/0-387-34633-3 |
| dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
| eu_rights_str_mv |
openAccess |
| rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
| dc.format.none.fl_str_mv |
application/pdf |
| dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
| reponame_str |
SEDICI (UNLP) |
| collection |
SEDICI (UNLP) |
| instname_str |
Universidad Nacional de La Plata |
| instacron_str |
UNLP |
| institution |
UNLP |
| repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
| repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
| _version_ |
1844615818045816832 |
| score |
13.070432 |