About: On-line suffix tree construction with reduced branching

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: On-line suffix tree construction with reduced branching Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://www.sciencedirect.com/science/article/pii/S1570866712000159
Description	Classical suffix tree construction algorithms by McCreight and Ukkonen spend most of the time looking up the right branch to follow from the current node. However, not all these slow branching operations are necessary. A significant portion of them is used for implicit suffix link simulation and can be avoided by replacing the traditional top-down descent with bottom-up climbing. We describe the bottom-up approach and analyze its costs and benefits. An experimental evaluation on two standard data corpora shows that bottom-up climbing removes forty to sixty six percent of branching operations and consequently saves twenty one to thirty two percent of construction time. However, a theoretical analysis of the worst-case behavior reveals that the time complexity of the bottom-up approach is superlinear. This is remedied by a combination of both approaches that removes nearly as many branching operations as the bottom-up climb, but still runs in linear time like the top-down descent. Classical suffix tree construction algorithms by McCreight and Ukkonen spend most of the time looking up the right branch to follow from the current node. However, not all these slow branching operations are necessary. A significant portion of them is used for implicit suffix link simulation and can be avoided by replacing the traditional top-down descent with bottom-up climbing. We describe the bottom-up approach and analyze its costs and benefits. An experimental evaluation on two standard data corpora shows that bottom-up climbing removes forty to sixty six percent of branching operations and consequently saves twenty one to thirty two percent of construction time. However, a theoretical analysis of the worst-case behavior reveals that the time complexity of the bottom-up approach is superlinear. This is remedied by a combination of both approaches that removes nearly as many branching operations as the bottom-up climb, but still runs in linear time like the top-down descent. (en)
Title	On-line suffix tree construction with reduced branching On-line suffix tree construction with reduced branching (en)
skos:prefLabel	On-line suffix tree construction with reduced branching On-line suffix tree construction with reduced branching (en)
skos:notation	RIV/00216208:11320/12:10100613!RIV13-MSM-11320___
http://linked.open...avai/riv/aktivita	S Z
http://linked.open...avai/riv/aktivity	S, Z(MSM0021620838)
http://linked.open...iv/cisloPeriodika	April
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Dvořák, Tomáš Senft, Martin
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Univerzita Karlova v Praze / Matematicko-fyzikální fakulta
http://linked.open...dnocenehoVysledku	156574
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/12:10100613
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	sliding window; branching; construction algorithm; suffix tree (en)
http://linked.open.../riv/klicoveSlovo	sliding window branching suffix tree construction algorithm
http://linked.open...odStatuVydavatele	NL - Nizozemsko
http://linked.open...ontrolniKodProRIV	[D93119CEC1FA]
http://linked.open...i/riv/nazevZdroje	Journal of Discrete Algorithms
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...UplatneniVysledku	2012
http://linked.open...v/svazekPeriodika	12
http://linked.open...iv/tvurceVysledku	Dvořák, Tomáš Senft, Martin
http://linked.open...n/vavai/riv/zamer	Moderní metody, struktury a systémy informatiky
issn	1570-8667
number of pages	13 (xsd:int)
http://bibframe.org/vocab/doi	10.1016/j.jda.2012.01.001
http://localhost/t...ganizacniJednotka	11320

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software