Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure

DOI10.1007/978-3-642-02441-2_5MaRDI QIDQ3637103zbMATH OpenOpenAlexFDO

Authors Andrzej Ehrenfeucht, Sung-Whan Woo, R. M. McConnell

Publication date 7 July 2009

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02441-2_5

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Algorithms on strings (68W32)

Recommendations

• Position heaps: a simple and dynamic text indexing data structure
• scientific article; zbMATH DE number 1003303
• Improved Dynamic Text Indexing
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching

Cites work

• A four-stage algorithm for updating a Burrows-Wheeler transform
• Compression of individual sequences via variable-rate coding
• File structures using hashing functions
• scientific article; zbMATH DE number 3883638 (Why is no real title available?)
• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• Introduction to algorithms
• On updating suffix tree labels
• Suffix Arrays: A New Method for On-Line String Searches

Cited in

(2)

• Suffix tree of alignment: an efficient index for similar data
• Position heaps: a simple and dynamic text indexing data structure

This page was built for publication: Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure

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