On suffix extensions in suffix trees

DOI10.1016/J.TCS.2012.07.018MaRDI QIDQ714837zbMATH OpenOpenAlexWikidataFDO

Authors Dany Breslauer, Giuseppe F. Italiano

Publication date 11 October 2012

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2012.07.018

zbMATH Keywords

suffix treesstring algorithms

Mathematics Subject Classification ID

Data structures (68P05) Graph representations (geometric and intersection representations, etc.) (05C62) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Algorithms on strings (68W32)

Recommendations

• On-line construction of suffix trees
• On-line suffix tree construction with reduced branching
• From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction

Cites work

• scientific article; zbMATH DE number 3913711 (Why is no real title available?)
• scientific article; zbMATH DE number 3913713 (Why is no real title available?)
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 1947389 (Why is no real title available?)
• scientific article; zbMATH DE number 1522932 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• scientific article; zbMATH DE number 801745 (Why is no real title available?)
• A Space-Economical Suffix Tree Construction Algorithm
• A four-stage algorithm for updating a Burrows-Wheeler transform
• Algorithms on Strings, Trees and Sequences
• Complete inverted files for efficient text retrieval and analysis
• Constructing suffix arrays in linear time
• Construction of Aho Corasick automaton in linear time for integer alphabets
• Dynamic extended suffix arrays
• Fast incremental planarity testing
• From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
• Improved dynamic dictionary matching
• Linear time algorithms for finding and representing all the tandem repeats in a string
• Linear work suffix array construction
• Maintaining order in a generalized linked list
• Near real-time suffix tree construction via the fringe marked ancestor problem
• On suffix extensions in suffix trees
• On the sorting-complexity of suffix tree construction
• On-line construction of suffix trees
• Optimal off-line detection of repetitions in a string
• PATRICIA
• Range non-overlapping indexing
• Space efficient linear time construction of suffix arrays
• Suffix Arrays: A New Method for On-Line String Searches
• The smallest automaton recognizing the subwords of a text
• Transducers and repetitions
• Uniqueness Theorems for Periodic Functions

Cited in

(11)

• scientific article; zbMATH DE number 5050583 (Why is no real title available?)
• On suffix tree detection
• From Suffix Trees to Suffix Vectors
• On suffix tree detection
• Dynamic construction of an antidictionary with linear complexity
• A linear time algorithm for shortest cyclic cover of strings
• scientific article; zbMATH DE number 742990 (Why is no real title available?)
• Converting suffix trees into factor/suffix oracles
• On suffix extensions in suffix trees
• The suffix tree of a tree and minimizing sequential transducers
• The Property Suffix Tree with Dynamic Properties

Describes a project that uses

Uses Software

• PATRICIA

This page was built for publication: On suffix extensions in suffix trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714837)