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

DOI10.1007/978-3-642-02441-2_5zbMath1247.68066OpenAlexW1746392762MaRDI QIDQ3637103

Sung-Whan Woo, Andrzej Ehrenfeucht, Ross 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

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

Related Items (1)

Position heaps: a simple and dynamic text indexing data structure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A four-stage algorithm for updating a Burrows-Wheeler transform
• On updating suffix tree labels
• Suffix Arrays: A New Method for On-Line String Searches
• Compression of individual sequences via variable-rate coding
• File structures using hashing functions

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