Space-efficient construction algorithm for the circular suffix tree

DOI10.1007/978-3-642-38905-4_15MaRDI QIDQ4928568zbMATH OpenOpenAlexFDO

Authors Wing-Kai Hon, Tsung-Han Ku, Rahul Shah, Sharma V. Thankachan

Publication date 14 June 2013

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

Full work available at URL https://doi.org/10.1007/978-3-642-38905-4_15

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Recommendations

• Efficient algorithm for circular Burrows-Wheeler transform
• Sparse suffix tree construction in small space
• On-line construction of suffix trees
• Combinatorial Pattern Matching
• Space-efficient construction of compressed suffix trees

Cited in

(8)

• Efficient algorithm for circular Burrows-Wheeler transform
• Fast circular dictionary-matching algorithm
• Succinct indexes for circular patterns
• Searching and indexing circular patterns
• Sorting circular suffixes in linear time
• Internal pattern matching in small space and applications
• Approximate circular pattern matching
• Improved circular dictionary matching

This page was built for publication: Space-efficient construction algorithm for the circular suffix tree

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